LightOJ 1265
来源:互联网 发布:dijkstra算法 poj 编辑:程序博客网 时间:2024/06/01 20:08
You are in a reality show, and the show is way too real that they threw into an island. Only two kinds of animals are in the island, the tigers and the deer. Though unfortunate but the truth is that, each day exactly two animals meet each other. So, the outcomes are one of the following
a) If you and a tiger meet, the tiger will surely kill you.
b) If a tiger and a deer meet, the tiger will eat the deer.
c) If two deer meet, nothing happens.
d) If you meet a deer, you may or may not kill the deer (depends on you).
e) If two tigers meet, they will fight each other till death. So, both will be killed.
If in some day you are sure that you will not be killed, you leave the island immediately and thus win the reality show. And you can assume that two animals in each day are chosen uniformly at random from the set of living creatures in the island (including you).
Now you want to find the expected probability of you winning the game. Since in outcome (d), you can make your own decision, you want to maximize the probability.
Input
Input starts with an integer T (≤ 200), denoting the number of test cases.
Each case starts with a line containing two integers t (0 ≤ t ≤ 1000) and d (0 ≤ d ≤ 1000) where t denotes the number of tigers and d denotes the number of deer.
Output
For each case, print the case number and the expected probability. Errors less than 10-6 will be ignored.
Sample Input
4
0 0
1 7
2 0
0 10
Sample Output
Case 1: 1
Case 2: 0
Case 3: 0.3333333333
Case 4: 1
//老虎死完即胜利 跟鹿的数量没有关系//所有情况数:(t+1)*t 老虎相遇:(t-1)*t#include<stdio.h>#include<string>#include<cstring>#include<queue>#include<algorithm>#include<functional>#include<vector>#include<iomanip>#include<math.h>#include<iostream>#include<sstream>#include<stack>#include<set>#include<bitset>using namespace std;int main(){ cout<<fixed<<setprecision(10); cin.sync_with_stdio(false); int T,t,d; cin>>T; for (int cases=1;cases<=T;cases++) { cin>>t>>d; double Ans=1; if (t%2==1) Ans=0; else if (t==0) Ans=1; else while (t) { Ans*=1.0*(t-1.0)/(t+1.0); t-=2; } cout<<"Case "<<cases<<": "<<Ans<<endl; } return 0;}
- LightOJ 1265
- lightoj 1265 概率dp
- lightoj 1265 概率
- Lightoj 1265(概率dp)
- LightOJ 1265 概率
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- [LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- Linux系统调用与文件I/O(一)(2)
- A + B Problem II 大数相加(可以作为模板题)
- Android NestedScrolling机制完全解析 带你玩转嵌套滑动
- XML的特殊字符处理
- python数据类型篇
- LightOJ 1265
- Java注解
- PHP数据类型转换
- INFORMATICA学习之路-0-入门前
- 相对路径与绝对路径(一半原创)
- MFC--把dll加载到资源中
- Python快速学习第六天
- HDU 5584 LCM Walk 数学
- Linux进程线程学习笔记:进程创建