概率好题 Light OJ 1027

//看看会不会爆int!数组会不会少了一维！
//取物问题一定要小心先手胜利的条件
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define mk make_pair
#define fi first
#define se second
const double eps = 1e-10;
const int maxn = 100 + 5;
int a[maxn];

int gcd(int a, int b){
    return b == 0 ? a : gcd(b, a % b);
}

int main(){
    int kase = 0;
    int t; cin >> t;
    while (t--){
        int n;
        scanf("%d", &n);
        int post = 0, sum = 0;
        for (int i = 1; i <= n; i++){
            scanf("%d", a + i);
            sum += abs(a[i]);
            if (a[i] > 0) post++;
        }
        printf("Case %d: ", ++kase);
        if (post == 0){
            printf("inf\n"); continue;
        }
        int g = gcd(sum, post);
        printf("%d/%d\n", sum / g, post / g);
    }
    return 0;
}