HDU 4465 Candy (概率)
2017-10-05 14:01
381 查看
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?
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.
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.
Sample Input
10 0.400000
100 0.500000
124 0.432650
325 0.325100
532 0.487520
2276 0.720000
Sample Output
Case 1: 3.528175
Case 2: 10.326044
Case 3: 28.861945
Case 4: 167.965476
Case 5: 32.601816
Case 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
-f[i])+(1+n)*log(p)+i*log(1-p);
double B=(f[n+i]-f
-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;
}
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?
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.
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.
Sample Input
10 0.400000
100 0.500000
124 0.432650
325 0.325100
532 0.487520
2276 0.720000
Sample Output
Case 1: 3.528175
Case 2: 10.326044
Case 3: 28.861945
Case 4: 167.965476
Case 5: 32.601816
Case 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
-f[i])+(1+n)*log(p)+i*log(1-p);
double B=(f[n+i]-f
-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;
}
相关文章推荐
- HDU 4465 - Candy(概率与数学优化)
- hdu 4465 Candy(概率公式+极大乘极小,4级)
- Hdu 4465 Candy (概率 对数 组合数 负二项分布)
- hdu 4465 Candy(概率公式+极大乘极小,4级)
- hdu 4465 Candy - 概率 log 组合数
- hdu 4465 Candy - 概率 log 组合数
- HDU 4465 Candy 概率期望值的对数优化
- HDU 4465 Candy(概率)
- HDU 4465 Candy 概率 (2012成都区域赛B题)
- HDU 4465 - Candy(概率与数学优化)
- hdu 4465 Candy(二次项概率)
- Hdu 4465 Candy (快速排列组合+概率)
- hdu 4465 Candy (概率期望)
- [概率+对数优化] hdu 4465 Candy
- hdu 4465 Candy 数学期望 负二项分布与 数值计算技巧
- hdu 4465 Candy 快速全排列
- hdu 4465 Candy
- HDU 4465 Candy( 期望)
- hdu 4465 Candy
- HDU 4465 Candy--数学求期望