제출 #965548

#제출 시각아이디문제언어결과실행 시간메모리
965548mraronRack (eJOI19_rack)C++14
40 / 100
1068 ms500 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...