Submission #1223064

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223064		AlgorithmWarrior	Rack (eJOI19_rack)	C++20	100 / 100	5 ms	4620 KiB

rack

#include <bits/stdc++.h>

using namespace std;

int const MOD=1000000007;
int const NMAX=1000005;
int pow2[NMAX];

int main()
{
    int n;
    long long k;
    cin>>n>>k;
    int i;
    pow2[0]=1;
    for(i=1;i<NMAX;++i)
        pow2[i]=2*pow2[i-1]%MOD;
    --k;
    int sum=1;
    for(i=0;i<64;++i)
        if(k&(1LL<<i))
            sum=(sum+pow2[n-i-1])%MOD;
    cout<<sum;
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 60 / 60