Submission #1188728

#TimeUsernameProblemLanguageResultExecution timeMemory
1188728mkkkkkkkkRack (eJOI19_rack)C++20
100 / 100
12 ms8208 KiB
#include <bits/stdc++.h> using namespace std; long long mod=1000000007; long long poww[1000001]; int main() { long long br=1; for(long long i=0;i<=1000000;i++,br=(br*2)%mod) poww[i]=br; long long n,k; cin>>n>>k; long long res=0; for(long long brr=2,i=poww[n-1];n>=1;k=k/2+k%2,n--) { i=poww[n-1]; if(k%brr==0) res=(res+i)%mod; } cout<<(res+1)%mod; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...