# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337432 | MilosMilutinovic | Rack (eJOI19_rack) | C++14 | 2 ms | 384 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;
#define ll long long
const int mod=1e9+7;
void ckadd(ll&a,ll b){a+=b;if(a>=mod)a%=mod;}
ll mul(ll a,ll b){return a*b%mod;}
void ckmul(ll&a,ll b){a=mul(a,b);}
ll powmod(ll x,ll k){ll ans=(ll)1;for(;k;k>>=1,ckmul(x,x))if(k&1)ckmul(ans,x);return ans;}
int n;
ll k;
int main(){
scanf("%i %lld",&n,&k);
long long ans=1;
for(ll i=0;i<n;i++){
if(k%2==0)ckadd(ans,powmod(2,n-i-1));
//if(k%2==0)printf("%i %lld\n",i,powmod(2,n-i-1));
k=(k+1)/2;
}
printf("%lld",ans);
return 0;
}
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... |