Submission #530560

#TimeUsernameProblemLanguageResultExecution timeMemory
530560MonkeyRack (eJOI19_rack)C++14
0 / 100
0 ms204 KiB
#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=0; int potega=1, zasieg; int ile, ruch=0; int i; cin >> n >> ile; for(i=1; 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; } } ++akt; cout << akt; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...