lightoj 1027 A Dangerous Maze 期望,玄学
来源:互联网 发布:现在java好找工作吗 编辑:程序博客网 时间:2024/06/04 18:47
题目:
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 afterxi 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
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
第一道期望的题,感觉遇上了玄学,还是用一张图来说明吧:
- lightoj 1027 A Dangerous Maze 期望,玄学
- Lightoj 1027 - A Dangerous Maze 【期望】
- Lightoj 1027 A Dangerous Maze 概率期望
- 【期望dp】Lightoj 1027 A Dangerous Maze
- LightOJ 1027 - A Dangerous Maze (期望)
- LightOJ 1027 A Dangerous Maze(期望)
- [lightOJ 1027]A Dangerous Maze[期望]
- lightOJ 1027 A Dangerous Maze 概率&期望
- 【LightOJ 1027】A Dangerous Maze(期望)
- LightOJ 1027 Dangerous Maze【期望】
- LightOJ 1027 A Dangerous Maze 概率期望学习小记
- LightOJ 题目1027 - A Dangerous Maze(期望)
- [LightOJ 1027] A Dangerous Maze (概率与期望)
- LightOJ-1027-A Dangerous Maze(概率/期望)
- 【概率&数学期望】A Dangerous Maze LightOJ
- LightOJ 1027 A Dangerous Maze
- LightOJ 1027-A Dangerous Maze
- LightOJ 1027 A Dangerous Maze
- 关于Java的反射机制,你需要理解这些..
- uGUI那些事儿一
- CSS代码缩写,占用更少的带宽/字体缩写/盒模型代码简写/颜色值缩写
- HttpClient使用学习(转载)
- jQuery 中一些细节知识点2(本文会持续更新)
- lightoj 1027 A Dangerous Maze 期望,玄学
- Python网络爬虫学习
- 分布式事务
- Java List 用法代码分析(非常详细)
- 玩转Eclipse--如何使用eclipse可以更好的提高我们的工作效率
- 颜色值的几种写法,长度值(px(像素)、em、% 百分比)
- Python网络爬取的代码以及信息
- 131.短信备份优化(接口实现)
- Protocol-net使用