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 nspace 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个门,选择每个门的概率相同,每个门都对应一个时间,如果时间为正值,就表示此门可以走出去,时间为负值,表示走此门还是会回到原地,而且还花费时间,但是回到原地以前的记忆就在没了,也就是说前边的时间作废。求出去的时间期望。
分析:假设每次出去的时间期望为d,那么每次回到原地以前的时间就不算了,所以出去的时间期望还是d。
所以由样例三列出方程:
d = 1/3 * 3 + 1/3 * (6 + d) + 1/3 * (9 + d)
化简得到 d = 3 + 6 + 9 = 18;
将结论总结成一般情况,假设有n个门,m个门会回到原地,则 d = time(总) / (n - m)
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int gcd(int a,int b)
{
if(a == 0) return b;
return gcd(b % a,a);
}
int main()
{
int T,n,k;
cin >> T;
int Case = 0;
while(T --)
{
cin >> n;
int time = 0,m = 0;
for(int i = 0;i < n;i ++)
{
cin >> k;
if(k < 0) m ++;
time += abs(k);
}
if(m == n)
printf("Case %d: inf\n",++ Case);
else printf("Case %d: %d/%d\n",++ Case,time / gcd(time,n - m),(n - m) / gcd(time,n - m));
}
return 0;
}