HDU 4465 Candy (概率)
来源:互联网 发布:4g卡为什么显示3g网络 编辑:程序博客网 时间:2024/05/29 15:15
Candy
Problem Description
LazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies initially. Everyday he chooses one box and open it. He chooses the first box with probability p and the second box with probability (1 - p). For the chosen box, if there are still candies in it, he eats one of them; otherwise, he will be sad and then open the other box.
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
Input
There are several test cases.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
Output
For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is a real number indicating the desired answer.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Sample Input
10 0.400000100 0.500000124 0.432650325 0.325100532 0.4875202276 0.720000
Sample Output
Case 1: 3.528175Case 2: 10.326044Case 3: 28.861945Case 4: 167.965476Case 5: 32.601816Case 6: 1390.500000
http://blog.csdn.net/u013582254/article/details/48055467
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<stdlib.h>using namespace std;typedef long long ll;double f[400115];int main(){double p;int n,m=1;f[0]=0;for(int i=1;i<400105;i++)f[i]=f[i-1]+log(1.0*i);while(scanf("%d%lf",&n,&p)!=EOF){double ans=0.0;for(int i=0;i<n;i++){double A=(f[n+i]-f[n]-f[i])+(1+n)*log(p)+i*log(1-p);double B=(f[n+i]-f[n]-f[i])+(1+n)*log(1-p)+i*log(p); ans=ans+(n-i)*(exp(A)+exp(B));}printf("Case %d: %.6lf\n",m++,ans);}return 0;}
阅读全文
0 0
- HDU 4465 Candy(概率)
- HDU 4465 Candy (概率)
- hdu 4465 Candy (数值计算 概率)
- hdu 4465 Candy (概率期望)
- hdu 4465 Candy( 概率 log 组合数 )
- HDU 4465 - Candy(概率与数学优化)
- hdu 4465 Candy - 概率 log 组合数
- [概率+对数优化] hdu 4465 Candy
- Hdu 4465 Candy (概率 对数 组合数 负二项分布)
- hdu 4465 Candy(概率公式+极大乘极小,4级)
- HDU 4465 Candy 概率 (2012成都区域赛B题)
- HDU ACM 4465 Candy->概率-数学期望-排列组合
- HDU 4465 Candy 概率期望值的对数优化
- hdu 4465 Candy (快速排列组合 )
- HDU 4465 (candy)(期望+log优化)
- HDU 4465 Candy
- HDU 4465 Candy
- HDU 4465 candy
- 正则表达式Reguler Expression (with python re)
- SSD目标检测理解
- HDU
- 第一次课转载的笔记
- [简单题]换一个思维,代码简洁度就完全变了(Python实现)
- HDU 4465 Candy (概率)
- docker使用教程
- Atom python3 UnicodeEncodeError: 'ascii' codec can't encode characters in position
- bzoj 2599: [IOI2011]Race(树的点分治)
- HDU6183 Color it(线段树 动态开点)
- sql之left join、right join、inner join的区别
- pata1060
- 微信图书馆开发——cnsoft总结
- Spark性能优化:数据数据倾斜(Data Skew)