| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 285690 | wildturtle | Rack (eJOI19_rack) | C++14 | 130 ms | 102404 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;
long long a,b,c,d,i,e,f,g,n,m,k,l,X[500005],x;
vector <long long> v;
int main() {
cin>>n>>k;
X[0]=1;
for(long long i=1;i<=n;i++) {
X[i]=X[i-1]*2;
}
if(k==1) { cout<<1; return 0; }
v.push_back(1);
x=n;
while(true) {
x--;
a=v.size();
for(long long i=0;i<a;i++) {
v.push_back(v[i]+X[x]);
}
if(v.size()>=k) break;
}
cout<<v[k-1];
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
