Submission #637489

#TimeUsernameProblemLanguageResultExecution timeMemory
637489ksu2009enRack (eJOI19_rack)C++17
40 / 100
157 ms102400 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...