Lightoj 1027 A - A Dangerous Maze
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace std;
#define lson 2*i
#define rson 2*i+1
#define LS l,mid,lson
#define RS mid+1,r,rson
#define UP(i,x,y) for(i=x;i<=y;i++)
#define DOWN(i,x,y) for(i=x;i>=y;i--)
#define MEM(a,x) memset(a,x,sizeof(a))
#define W(a) while(a)
#define gcd(a,b) __gcd(a,b)
#define LL long long
#define N 1000005
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define EXP 1e-8
#define lowbit(x) (x&-x)
int gcd(int x,int y){
if(y==0) return x;
else return(gcd(y,x%y));
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
int main()
{
int T,n,x[105];
scanf("%d",&T);
for(int j=1;j<=T;j++)
{
int pos=0,sum=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&x[i]);
sum+=abs(x[i]);
if(x[i]>0)
pos++;
}
if(pos==0)
{
printf("Case %d: inf\n",j);
continue;
}
printf("Case %d: %d/%d\n",j,sum/gcd(sum,pos),pos/gcd(sum,pos));
}
}