A Dangerous Maze （LightOJ-1027）（期望DP）

You are in a maze; seeing n doors in front of you in beginning. You can choose any door you like. The probability for choosing a door is equal for all doors.

If you choose the ith door, it can either take you back to the same position where you begun in xi minutes, or can take you out of the maze after xi minutes. If you come back to the same position, you can't remember anything. So, every time you come to the beginning position, you have no past experience.

Now you want to find the expected time to get out of the maze.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a blank line and an integer n (1 ≤ n ≤ 100) denoting the number of doors. The next line contains n space separated integers. If the ith integer (xi) is positive, you can assume that the ith door will take you out of maze after xi minutes. If it's negative, then the ith door will take you back to the beginning position after abs(xi) minutes. You can safely assume that 1 ≤ abs(xi) ≤ 10000.

Output

For each case, print the case number and the expected time to get out of the maze. If it's impossible to get out of the maze, print 'inf'. Print the result in p/q format. Where p is the numerator of the result and q is the denominator of the result and they are relatively prime. See the samples for details.

Sample Input

3

 

1

1

 

2

-10 -3

 

3

3 -6 -9

Sample Output

Case 1: 1/1

Case 2: inf

Case 3: 18/1

 

题意：给你n个门，每次进每个门的概率都是一样的，正数代表你x分钟后可以离开这里，负数代表你x分钟后回到这里。求预期离开的时间。

思路：设期望为 E ，选择 ti<0的门， 就相当于浪费了−ti的时间，因此此时的期望为（E−ti）/n 。若选择 ti>0的门，则此时期望为ti/n。设所有 ti>0之和为T0，设所有 ti<0之和为T1 。E=T0/n−T1/n+(n0/n)*E，因此 E=(T0+T1)/n1

AC代码：

#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <iomanip>
typedef long long ll;
const int maxx=10010;
const int inf=0x3f3f3f3f;
using namespace std;
int gcd(int a,int b)
{
    return a%b?gcd(b,a%b):b;
}
int main()
{
    int t;
    int k=1;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a=0,b=0;
        for(int i=0; i<n; i++)
        {
            int x;
            cin>>x;
            if(x>0)
                b++;
            a+=abs(x);
        }
        cout<<"Case"<<" "<<k++<<":"<<" ";
        if(b==0)
            cout<<"inf"<<endl;
        else
        {
            int c=gcd(a,b);
            cout<<a/c<<"/"<<b/c<<endl;
        }
    }
    return 0;
}