# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530552 | 2022-02-25T19:58:31 Z | Monkey | Rack (eJOI19_rack) | C++14 | 1 ms | 332 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN=1e6+7; int wieszaki[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, akt; int potega=1, zasieg; int ile, ruch=1; int i; cin >> ile >> n; for(i=2; i<=n; ++i) { potega*=2; } zasieg=potega/2; ++wieszaki[0]; while(ruch<ile) { zasieg/=2; akt=0; while(akt<potega && ruch<ile) { akt+=zasieg; if(zasieg==1) { continue; } ++wieszaki[akt]; ++ruch; } } cout << akt+1; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |