#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<string>
#include<memory.h>
using namespace std;
int gcd(int a, int b)
{
if (b == 0) return a;
return gcd(b, a%b);
}
int main()
{
int T;
cin >> T;
int u = 0;
while (T--)
{
int n;
cin >> n;
int zhengge = 0, zhengsum = 0, fuge = 0, fusum = 0;
for (int a = 0;a < n;a++)
{
int shu;
cin >> shu;
if (shu > 0)zhengge++, zhengsum += shu;
else fuge++, fusum += -shu;
}
if (zhengge == 0)printf("Case %d: inf\n", ++u);
else printf("Case %d: %d/%d\n", ++u,(zhengsum+fusum)/gcd(zhengsum + fusum, n - fuge),(n-fuge) / gcd(zhengsum + fusum, n - fuge));
}
return 0;
}
lightoj 1027 幼儿园概率...
最新推荐文章于 2017-10-13 22:23:03 发布