# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564831 | mircea_007 | Rack (eJOI19_rack) | C++17 | 1 ms | 328 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.
// This program was written on 19.05.2022
// for problem rack
// by Mircea Rebengiuc
#include <stdio.h>
#define MOD 1000000007
#define INV2 500000004LL
int lgput( int base, int exp ){
int retval = 1;
while( exp ){
if( exp & 1 )
retval = ((long long)retval) * base % MOD;
base = ((long long)base) * base % MOD;
exp >>= 1;
}
return retval;
}
int main(){
int n, ans = 1, p2 = 1;
long long k;
scanf( "%d%lld", &n, &k );
k--;
p2 = lgput( 2, n - 1 );
while( k ){
ans += p2 * (k & 1);
ans %= MOD;
p2 = (INV2 * p2) % MOD;
k >>= 1;
}
printf( "%d\n", 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... |