# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965548 | mraron | Rack (eJOI19_rack) | C++14 | 1068 ms | 500 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<bool> lvl(n);
for(int i=0; i<k; i++){
for(int j=0; j<n; j++){
if(i%int(pow(2, j)) == 0) lvl[j] = !lvl[j];
}
}
int o1 = 1;
for(int i=0; i<n; i++) o1 += !lvl[i] * pow(2, n-i-1);
cout << o1;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |