该题限制较少,运用连续概率公式即可。
细节参见代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 10000;
int T,kase=0;
ll n,k;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a%b);
}
int main() {
scanf("%d",&T);
while(T--) {
scanf("%lld%lld",&n,&k);
ll b = pow(2,k);
ll a = b - (k+1);
ll c = gcd(a,b);
a /= c; b /= c;
printf("Case #%d: %lld/%lld\n",++kase,a,b);
}
return 0;
}