HDU 4465 Candy(概率)
来源:互联网 发布:windows 10 arm版下载 编辑:程序博客网 时间:2024/05/18 01:38
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
Source
2012 Asia Chengdu Regional Contest
分析:枚举还剩i个A(B)钟即可,这种题见得少,其实就是概率论里练习题的水平,
但是要组合数,注意到n达1e5,无法胜任,还是要取log
#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<string>#include<iostream>#include<queue>#include<cmath>#include<map>#include<stack>#include<set>using namespace std;#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )#define CLEAR( a , x ) memset ( a , x , sizeof a )const int INF=0x3f3f3f3f;typedef long long LL;const int maxn=(1e5+100)*2;int n;double p;double f[maxn*2+100];int main(){ f[0]=0; for(int i=1;i<=maxn*2;i++) f[i]=f[i-1]+log(1.0*i); int cas=1; while(~scanf("%d%lf",&n,&p)) { double sum=0.0; for(int i=1;i<=n;i++)//枚举还剩i个 { double A=(f[2*n-i]-f[n-i]-f[n])+(n-i)*log(p)+(n+1)*log(1-p); double B=(f[2*n-i]-f[n-i]-f[n])+(n-i)*log(1-p)+(n+1)*log(p); sum+=(exp(A)+exp(B))*i; } printf("Case %d: %.6f\n",cas++,sum); } 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
- oracle 正则表达式 ( 前端传入连续字符串分析..)
- 实习结束,准备校招,我又开始写博客啦,夯实基础才是最重要的!
- 程序模版
- ASP实现上传图片自动 压缩图片大小 留存待修改
- Android的安全机制和su概述
- HDU 4465 Candy(概率)
- InstaMaterial - eclipse 版(学习总结)
- how to find error in log
- spring security配置的注意细节
- Spring 整合 Redis
- Laravel实现一个简单的小例子
- iOS开发 - 通过ssh安装iPhone软件
- HDU 1257 最少拦截系统
- gsensor架构和原理分析