#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
//求分子分母最大公约数
int gcd(unsigned long long int m,unsigned long long int n)
{
unsigned long long int a,b,x;
a=max(m,n);
b=min(m,n);
while(a%b!=0)
{
x=a%b;
a=b;
b=x;
}
while(a%b==0)
return b;
}
int main()
{
int n,k,l;
unsigned long long int x,a,b;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&l,&k);
x=gcd((k+1),pow(2,k));
b=(pow(2,k))/x;
a=b-(k+1)/x;
printf("Case #%d: %lld/%lld\n",i,a,b);
}
return 0;
}
UVA 11971
最新推荐文章于 2020-09-02 11:40:52 发布