제출 #272433

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
272433		egekabas	Binary Subsequences (info1cup17_binary)	C++14	0 / 100	1026 ms	20488 KiB

binary

#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;
    if(x > y)
        return eul(x%(y+1), y);
    else
        return eul(x, y%(x+1));
}
void solve(){
    int k;
    cin >> k;
    int ans = 0;
    pii use;
    for(int i = 0; i <= k; ++i){
        if(eul(i, k-i)){
            ++ans;
            use = {i, k-i};
        }
    }
    cout << -1 << '\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
• Subtask 2: 0 / 39
• Subtask 3: 0 / 18