Submission #237579

#TimeUsernameProblemLanguageResultExecution timeMemory
237579HalfRack (eJOI19_rack)C++14
100 / 100
9 ms384 KiB
#include <iostream> #include <vector> #include <set> #include <map> #include <algorithm> #include <cmath> using namespace std; typedef vector<int> vi; typedef pair<int,int> pi; typedef long long ll; #define loop(i,a,b) for (int i = a; i <= b; i++) #define INF ((unsigned) ~0) #define F first #define S second #define PB push_back #define MP make_pair const ll MOD = 1000000000 + 7; int main(){ int n; ll k; cin >> n >> k; k--; ll res = 1; ll e; ll p; for(e = n - 1, p = 1; e >= 0; e--, p = (p * 2) % MOD) if(e < 60) if(k & ((ll)1<<e)) res = (res + p) % MOD; cout << res << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...