oj.uz

Submission #272443

# Submission time Handle Problem Language Result Execution time Memory
272443 2020-08-18T11:48:33 Z egekabas Binary Subsequences (info1cup17_binary) C++14
0 / 100
 650 ms 20656 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int mod = 1e9+7;
int eul(int x, int y){
    if(x == 0 && y == 0) return 1;
    if(x == y) return 0;
    return eul(y%(x+1), x);
}
void solve(){
    int k;
    cin >> k;
    int ans = 0;
    for(int i = 0; i <= k/2; ++i){
        if(eul(i, k-i))
            ans += 2;
    }
    cout << ans << '\n';
    while(k--)
        cout << "0 ";
    cout << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    int t;
    cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 104 ms 4388 KB Output isn't correct

Subtask #2
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 1400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 650 ms 20656 KB Output isn't correct
2 Halted 0 ms 0 KB -