Submission #369909

# Submission time Handle Problem Language Result Execution time Memory
369909 2021-02-22T17:55:19 Z AdamGS Rack (eJOI19_rack) C++14
100 / 100
10 ms 8172 KB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(ll a = 0; a < (b); ++a)
const ll MOD=1e9+7, LIM=1e6+7;
ll pot[LIM];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    pot[0]=1;
    rep(i, LIM-1) pot[i+1]=(pot[i]*2)%MOD;
    ll n, k, ans=0;
    cin >> n >> k; --k;
    for(ll i=n-1; i>=0; --i) {
        if(k&1) ans=(ans+pot[i])%MOD;
        k>>=1;
    }
    cout << ans+1 << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 9 ms 8172 KB Output is correct
2 Correct 9 ms 8172 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 10 ms 8172 KB Output is correct
5 Correct 9 ms 8172 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 8172 KB Output is correct
2 Correct 9 ms 8172 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 10 ms 8172 KB Output is correct
5 Correct 9 ms 8172 KB Output is correct
6 Correct 9 ms 8172 KB Output is correct
7 Correct 9 ms 8172 KB Output is correct
8 Correct 10 ms 8172 KB Output is correct
9 Correct 10 ms 8172 KB Output is correct
10 Correct 9 ms 8172 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 8172 KB Output is correct
2 Correct 9 ms 8172 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 10 ms 8172 KB Output is correct
5 Correct 9 ms 8172 KB Output is correct
6 Correct 9 ms 8172 KB Output is correct
7 Correct 9 ms 8172 KB Output is correct
8 Correct 10 ms 8172 KB Output is correct
9 Correct 10 ms 8172 KB Output is correct
10 Correct 9 ms 8172 KB Output is correct
11 Correct 9 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 9 ms 8172 KB Output is correct
14 Correct 10 ms 8172 KB Output is correct
15 Correct 10 ms 8172 KB Output is correct