lightoj 1027 简单概率dp

题目链接：http://lightoj.com/volume_showproblem.php?problem=1027

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int sum,ans,n,m;

int Gcd(int a,int b){
    if(a%b == )   return b;
    return Gcd(b,a%b);
}
int main()
{
    //freopen("E:\\acm\\input.txt","r",stdin);
    int T;
    cin>>T;
    for(int cas=;cas<=T;cas++){
        scanf("%d",&n);
        m = n;
        sum = ;
        for(int i=;i<=n;i++){
            int a;
            scanf("%d",&a);
            if(a<) m--;
            sum += abs(a);
        }
        printf("Case %d: ",cas);

        if(m == ) {   printf("inf\n");  continue;  }
        int G = Gcd(sum,m);
        printf("%d/%d\n",sum/G,m/G);
    }
}