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 <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
using namespace std;
typedef long long ll;
int main(){
ll n, k;
cin >> n >> k;
vector<ll>a = {1, 2};
for(int i = 1; i < n; i++){
vector<ll>b;
ll add = (1 << i);
for(auto j: a){
b.push_back(j);
b.push_back(j + add);
}
a = b;
}
/*
for(auto i: a)
cout << i << ' ';
cout << endl;
*/
cout << a[k - 1] << endl;
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... |