用等比数列求解
#include <bits/stdc++.h>
using namespace std;
#define int long long
double n;
double s;
double q_pow(double a, int b){
double res = 1;
while(b>0){
if(b&1) res *= a;
a *= a;
b >>= 1;
}
return res;
}
signed main(){
cin >> n >> s;
int ans = (s-n-1)/(q_pow(2, n+1)-1)+1;
cout << ans;
return 0;
}