light oj 1027 A Dangerous Maze（期望）

1027 - A Dangerous Maze

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

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 i^th door, it can either take you back to the same position where you begun in x_i minutes, or can take you out of the maze after x_i 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 i^th integer (x_i) is positive, you can assume that the i^th door will take you out of maze after x_i minutes. If it's negative, then the i^th door will take you back to the beginning position after abs(x_i) minutes. You can safely assume that 1 ≤ abs(x_i) ≤ 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 andq is the denominator of the result and they are relatively prime. See the samples for details.

Sample Input	Output for Sample Input
3   1 1   2 -10 -3   3 3 -6 -9	Case 1: 1/1 Case 2: inf Case 3: 18/1

 

想法：

设为正值的门的数量为n1，总共有n扇门。

走一次就出来的概率是n1/n，走出来的期望次数是n/n1.

走一次需要的平均时间为sum(ti)/n (1<=i<=n)

则走出来的时间期望是 sum(ti)/n *(n/n1) =sum(ti)/n1 .

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>

#define MEM(a,x) memset(a,x,sizeof a)
#define eps 1e-8
#define MOD 10009
#define MAXN 10010
#define MAXM 100010
#define INF 99999999
#define ll __int64
#define bug cout<<"here"<<endl
#define fread freopen("ceshi.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)

using namespace std;

int Read()
{
    char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    int x = 0;
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

void Print(int a)
{
     if(a>9)
         Print(a/10);
     putchar(a%10+'0');
}

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

int main()
{
//    fread;
    int tc;
    scanf("%d",&tc);
    int cs=1;
    while(tc--)
    {
        int n;
        scanf("%d",&n);
        int num=0;
        int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;
            scanf("%d",&x);
            if(x>=0)
            {
                num++;
                sum+=x;
            }
            else
            {
                sum+=(-1*x);
            }
        }
        printf("Case %d: ",cs++);
        if(num==0)
            puts("inf");
        else
        {
            int g=gcd(sum,num);
            printf("%d/%d\n",sum/g,num/g);
        }
    }
    return 0;
}