Submission #1204154

#TimeUsernameProblemLanguageResultExecution timeMemory
1204154PlayVoltzRack (eJOI19_rack)C++20
100 / 100
0 ms328 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second const int MOD = 1000000007; int expo(int a, int b){ int res=1; for (;b;a=(a*a)%MOD, b>>=1)if (b&1)res=(res*a)%MOD; return res; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k, ans=0; cin>>n>>k, --k; for (int i=0; i<64; ++i)if (k&(1ll<<i))ans=(ans+expo(2, n-i-1))%MOD; cout<<ans+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...