LightOJ 题目1027 - A Dangerous Maze(期望)

原创 2015年11月18日 22:05:03
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 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 ithdoor 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

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

 


PROBLEM SETTER: JANE ALAM JAN

题目大意:一个迷宫有n个门,每个对应一个值,正值表示经过这么多秒后直接出迷宫,负值代表这么多秒后回到最开始的地方,问最后出去的期望

思路:一次出去的概率为n1/n期望为n/n1,一次出去的平均时间问sum(t)/n,期望两个相乘即,sum(t)/n1

ac代码

616445 2015-11-18 19:53:53 1027 - A Dangerous Maze C++ 0.000 1688
Accepted
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
    if(a<b)
    {
        int t=a;
        a=b;
        b=t;
    }
    if(b==0)
        return a;
    return gcd(b,a%b);
}
int main()
{
    int t,c=0;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int sum=0,n1=0;
        int i;
        for(i=1;i<=n;i++)
        {
            int x;
            scanf("%d",&x);
            if(x<0)
                sum-=x;
            else
            {
                sum+=x;
                n1++;
            }
        }
        if(n1==0)
        {
            printf("Case %d: inf\n",++c);
            continue;
        }
        int tmp=gcd(sum,n1);
        printf("Case %d: %d/%d\n",++c,sum/tmp,n1/tmp);
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

Lightoj 1027 - A Dangerous Maze 【期望】

1027 - A Dangerous Maze PDF (English) Statistics Forum Time Limit: 2 second(s) Mem...

lightoj 1027 - A Dangerous Maze(不错的概率题)

题意 : 在n个门前选择一扇门出去, 然后如果第i扇门的 Xi值是正的话,你会花费Xi时间后出去 , 如果Xi是负数的话你会花费-Xi时间后回到老地方,并且忘记了刚才的选择, 选择一扇门的概率是等概的...

LightOJ - 1027 A Dangerous Maze 概率

题目大意:迷宫里面有n扇门,每扇门有相应的值,假设第i扇门的值为xi,如果xi > 0,那么xi分钟后,走该扇门就可以走出迷宫了,如果xi < 0,表示走了该扇门之后,需要abs(xi)分钟后才能回到...

手机厂商们,不鸡贼能死?

都是一样的鸡贼,用了不一样鸡贼的方式,小米是宣传上的鸡贼,魅族和华为则是在成本上的鸡贼。虽然鸡贼一个曝光一个,但厂商们依然前赴后继,一浪接一浪。...
  • csdnnews
  • csdnnews
  • 2017年09月15日 20:05
  • 12582

lightOJ 1027 A Dangerous Maze 概率&期望

作为一个概率期望题的初学者,总结有关期望的两点供自己以后检验: 1、期望的线性性质与全期望公式       全期望公式对应计数原理当中的加法原理,把每一种情况的期望乘以概率相加;线性公式对应计数原...
  • jijijix
  • jijijix
  • 2016年08月19日 22:53
  • 122

【期望dp】Lightoj 1027 A Dangerous Maze

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=84305#problem/A 一道很好的概率期望题目,没用到dp不过,再次理解了统计...

[LightOJ 1027] A Dangerous Maze (概率与期望)

Description You are in a maze; seeing n doors in front of you in beginning. You can choose any door...

LightOJ 1027 - A Dangerous Maze (期望)

题意: 迷宫n
  • lwt36
  • lwt36
  • 2015年11月02日 21:50
  • 194

LightOJ1027---A Dangerous Maze (期望)

You are in a maze; seeing n doors in front of you in beginning. You can choose any door you like. Th...

light OJ 1027 A Dangerous Maze (期望)

1027 - A Dangerous Maze PDF (English) Statistics Forum Time Limit: 2 s...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LightOJ 题目1027 - A Dangerous Maze(期望)
举报原因:
原因补充:

(最多只允许输入30个字)