oj.uz

답안 #272433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
272433 2020-08-18T11:46:25 Z egekabas Binary Subsequences (info1cup17_binary) C++14
0 / 100
 900 ms 20488 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;
    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.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 144 ms 4344 KB Output isn't correct

Subtask #2
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 48 ms 1404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1026 ms 20488 KB Time limit exceeded
2 Halted 0 ms 0 KB -