# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
439587 | LucaIlie | Rack (eJOI19_rack) | C11 | 1 ms | 284 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 <stdio.h>
#define MOD 1000000007
int main() {
int n, r, p2, e, i;
long long k;
scanf( "%d%lld", &n, &k );
k--;
p2 = 1;
e = 0;
r = 0;
for ( i = n - 1; i >= 0; i-- ) {
if ( ((k >> i) & 1) == 1 ) {
while ( e < (n - 1 - i) ) {
p2 = (p2 * 2) % MOD;
e++;
}
r = (r + p2) % MOD;
}
}
printf( "%d", r + 1 );
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... |