# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782025 | 2023-07-13T14:51:14 Z | Andrey | Binary Subsequences (info1cup17_binary) | C++14 | 900 ms | 340 KB |
#include <bits/stdc++.h> using namespace std; void solve() { int k,ans = 0,a = 0,b = 0,br = 0,sm = INT_MAX,c; cin >> k; for(int i = 0; i <= k; i++) { a = i; b = k-i; br = 0; while(a != b) { if(a < b) { swap(a,b); } a-=b+1; br++; } if(a == 0 && b == 0) { ans++; if(br < sm) { sm = br; c = i; } } } vector<int> wut(0); a = c; b = k-c; while(a != b) { if(a > b) { wut.push_back(0); a-=b+1; } else { wut.push_back(1); b-=a+1; } } cout << ans << "\n"; for(int i = 0; i < wut.size(); i++) { cout << wut[i] << " "; } cout << "\n"; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while(t--) { solve(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 133 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 53 ms | 296 KB | Output is correct |
2 | Correct | 114 ms | 296 KB | Output is correct |
3 | Correct | 115 ms | 300 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1082 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |