当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3051:Peaceful Negotiation

题目描述
Long lasting wars bored country A and B, they decided to dispatch n people to have a peaceful negotiation, respectively. The peaceful negotiation will hold on a round table. But the delegate from country A may has conflict with the delegate from country B. Due to this reason, we hope the people who sit in the round table would not have conflict with the people on both sides. To simplify this problem, suppose the delegate from A exactly has one conflict people in the delegate from B, the delegate from B exactly has one conflict people in the delegate from A. Please calculate probability of the seat choice satisfied the request described above.
输入解释
The input contains several test cases. The first line is a positive integer T which means there are T test cases below. The following T lines each contains a positive integer n(1<=n<=5000) which represents the conflict pairs described above.
输出解释
The output contains T lines, each represents the probability of the seat choice satisfied the request described above when the n is given. For each test case, output the probability in a single line with the precision to 7 digits after the decimal point.
输入样例
2
2
3 
输出样例
0.3333333
0.2666667 
来自杭电HDUOJ的附加信息
Recommend gaojie

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3051

最后修改于 2020-10-25T22:59:35+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65535/65535K(Java/Others)