#include <bits/stdc++.h>
#define N 1000005
#define int long long
using namespace std;
const int mod = 1e9+7;
int pw[N];
int pw2(int b){
int ret = 1;
for(int i=0;i<b;i++){
ret = ret*2%mod;
}
return ret;
}
int get(int n,int k){
if(n == 0)return 1;
int ret = 0;
if(k > pw[n-1]){
ret = 1;
k -= pw[n-1];
}
return (2*get(n-1,k) -1 +ret+mod)%mod;
}
void solve(){
int n,k;
cin >> n >> k;
cout << get(n,k);
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#ifdef Local
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
pw[0] = 1;
for(int i=1;i<N;i++){
pw[i] = min((int)2e18,pw[i-1]*2);
}
int t=1;
//cin>>t;
while(t--){
solve();
}
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
8012 KB |
Output is correct |
2 |
Correct |
5 ms |
8012 KB |
Output is correct |
3 |
Correct |
5 ms |
8012 KB |
Output is correct |
4 |
Correct |
5 ms |
8012 KB |
Output is correct |
5 |
Correct |
5 ms |
8012 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
8012 KB |
Output is correct |
2 |
Correct |
5 ms |
8012 KB |
Output is correct |
3 |
Correct |
5 ms |
8012 KB |
Output is correct |
4 |
Correct |
5 ms |
8012 KB |
Output is correct |
5 |
Correct |
5 ms |
8012 KB |
Output is correct |
6 |
Correct |
5 ms |
8012 KB |
Output is correct |
7 |
Correct |
5 ms |
8084 KB |
Output is correct |
8 |
Correct |
6 ms |
8012 KB |
Output is correct |
9 |
Correct |
5 ms |
8012 KB |
Output is correct |
10 |
Correct |
5 ms |
8012 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
8012 KB |
Output is correct |
2 |
Correct |
5 ms |
8012 KB |
Output is correct |
3 |
Correct |
5 ms |
8012 KB |
Output is correct |
4 |
Correct |
5 ms |
8012 KB |
Output is correct |
5 |
Correct |
5 ms |
8012 KB |
Output is correct |
6 |
Correct |
5 ms |
8012 KB |
Output is correct |
7 |
Correct |
5 ms |
8084 KB |
Output is correct |
8 |
Correct |
6 ms |
8012 KB |
Output is correct |
9 |
Correct |
5 ms |
8012 KB |
Output is correct |
10 |
Correct |
5 ms |
8012 KB |
Output is correct |
11 |
Correct |
5 ms |
8012 KB |
Output is correct |
12 |
Correct |
5 ms |
8012 KB |
Output is correct |
13 |
Correct |
5 ms |
8140 KB |
Output is correct |
14 |
Correct |
6 ms |
8548 KB |
Output is correct |
15 |
Correct |
17 ms |
17280 KB |
Output is correct |