제출 #607280

#제출 시각아이디문제언어결과실행 시간메모리
607280xtkRack (eJOI19_rack)C++17
40 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("Ofast") // #define int long long #define fi first #define se second #define pb push_back #define mp make_pair const int MOD=1e9+7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; long long k; cin>>n>>k; k--; int ans=1; for (int i=1; i<=n; ++i) { if(k%2==1) { ans = ((long long)(ans*2+1))%MOD; } else { ans = ((long long)(ans*2))%MOD; } k/=2; } int pow=1; for (int i=1; i<=n; ++i) { pow = ((long long)pow*2)%MOD; } cout<<(ans-(pow-1))%MOD<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...