Submission #464359

#TimeUsernameProblemLanguageResultExecution timeMemory
464359amunduzbaevRack (eJOI19_rack)C++14
100 / 100
10 ms7884 KiB
#include "bits/stdc++.h" using namespace std; #define int long long const int mod = 1e9+7; int pw(int a, int b){ int rr = 1; while(b){ if(b&1) rr = rr * a % mod; a = a * a % mod, b >>= 1; } return rr; } void solve(){ int n, k; cin>>n>>k; vector<int> bit(n); for(int i=0;i<(int)bit.size();i++){ n--; if(n > 62){ bit[i] = 0; } else { if(k <= (1ll << n)) bit[i] = 0; else bit[i] = 1, k -= (1ll << n); } } //~ for(int i=0;i<(int)bit.size();i++) cout<<bit[i]<<" "; //~ cout<<"\n"; int res = 1, pw = 1; for(int i=0;i<(int)bit.size();i++){ if(bit[i]) res = (res + pw) % mod; pw = (pw * 2ll) % mod; } cout<<res<<"\n"; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //~ cin>>t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...