제출 #1154387

#제출 시각아이디문제언어결과실행 시간메모리
1154387FaggiRack (eJOI19_rack)C++20
100 / 100
10 ms8008 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; const int MAXN=1e6+1; ll levs[MAXN]; ll MOD=1e9+7; ll n; ll calc(ll act, ll lvl, ll pos) { if(lvl==n) return pos%MOD; if(act%2!=0) return calc(act/2,lvl+1,(pos+levs[lvl])%MOD); return calc(act/2,lvl+1, pos); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll k, tam, act, i; cin >> n >> k; levs[n-1]=1; for(i=n-2; i>=0; i--) levs[i]=(levs[i+1]*2)%MOD; act=k-1; cout << calc(act, 0, 1); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...