This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
const int mod = 1e9+7;
int pw(int a, int b){
	int rr = 1;
	while(b){
		if(b&1) rr = rr * 1ll * a % mod;
		a = a * 1ll * 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 > 63){
			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;
	for(int i=0;i<(int)bit.size();i++){
		if(bit[i]) res = (res + pw(2, i)) % 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 time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |