# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491808 | uncripted | Rack (eJOI19_rack) | C++11 | 9 ms | 8140 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 const m=1000000007;
long long a[1000005];
long long p2[1000001];
int main(){
long long n,k;
cin>>n>>k;
long long k1=k;
long long ii=1;
k1--;
p2[0]=1;
for(long long i=1; i<=1000001; i++){
p2[i]=(p2[i-1]*2)%m;
}
while(k1>0){
a[ii]=k1%2;
k1=k1/2;
ii++;
//cout<<k1<<"l"<<endl;
}
ii=n;
long long sum=0;
for(long long i=ii; i>=1; i--){
if(a[i]==1){
sum+=(p2[ii-i]);
sum=sum%m;
}
}
cout<<(sum+1)%m;
}
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... |