HDU4870:Rating(DP)
来源:互联网 发布:知乎的缺点 编辑:程序博客网 时间:2024/05/20 21:48
Problem Description
A little girl loves programming competition very much. Recently, she has found a new kind of programming competition named "TopTopTopCoder". Every user who has registered in "TopTopTopCoder" system will have a rating, and the initial value of rating equals to zero. After the user participates in the contest held by "TopTopTopCoder", her/his rating will be updated depending on her/his rank. Supposing that her/his current rating is X, if her/his rank is between on 1-200 after contest, her/his rating will be min(X+50,1000). Her/His rating will be max(X-100,0) otherwise. To reach 1000 points as soon as possible, this little girl registered two accounts. She uses the account with less rating in each contest. The possibility of her rank between on 1 - 200 is P for every contest. Can you tell her how many contests she needs to participate in to make one of her account ratings reach 1000 points?
Input
There are several test cases. Each test case is a single line containing a float number P (0.3 <= P <= 1.0). The meaning of P is described above.
Output
You should output a float number for each test case, indicating the expected count of contest she needs to participate in. This problem is special judged. The relative error less than 1e-5 will be accepted.
Sample Input
1.0000000.814700
Sample Output
39.00000082.181160因为每次50分,到达1000分,所以可以看做每次1分,到达20分dp[i]表示i到20的数学期望那么dp[i] = dp[i+1]*p+dp[i-2]*q+1;令t[i] = dp[i+1]-dp[i]则t[i] = (t[i+1]*p+t[i-2]*q)所以t[i+1] = (t[i]-t[i-2]*q)/p#include <stdio.h>int main(){ float p,sum,t[21],q; int i; while(~scanf("%f",&p)) { sum = 0; q = 1-p; t[0] = 1/p,t[1] = t[0]/p,t[2] = t[1]/p; sum = t[0]+t[1]+t[2]; for(i = 3;i<20;i++) { t[i] = (t[i-1]-t[i-3]*q)/p; sum+=t[i]; } printf("%.6f\n",sum*2-t[19]); } return 0;}
2 0
- HDU4870:Rating(DP)
- HDU4870:Rating(DP)
- hdu4870 Rating (高斯消元或者dp)
- 多校第一场 1010(HDU4870) rating---DP
- HDU4870 Rating(概率)
- hdu4870 Rating高斯消元
- Rating ,hdu4870(高校联赛第一场)
- hdu4870(概率dp)
- hdu4870(高斯消元解概率DP)
- hdu4870 概率DP
- hdu4870 Rating---2014 Multi-University Training Contest 1
- hdu4870 Rating 2014 Multi-University Training Contest 1
- hdu3976[Electric resistance] hdu5006[Resistance] hdu4870[Rating] 高斯消元
- 【HDU 4870】Rating【DP】
- [HDOJ 4870] Rating [概率DP]
- Rating - HDU 4870 期望dp
- 【HDU】4870 Rating 概率DP
- hdu 4870 Rating 概率dp
- Spring接口ApplicationContextAware介绍及使用
- CF#254 (Div. 2) B.
- 三种对象初始化代码,有何不同求解答
- 派生类到基类转换的可访问性——新解
- 60 谁获得了最高奖学金
- HDU4870:Rating(DP)
- mysql数据库迁移
- Code Jam - Store Credit for Python
- VPN寻址及路由
- struts2 全局拦截器,显示请求方法和参数
- 62 笨小熊
- 字典树模板及讲解 http://www.cnblogs.com/tanky_woo/archive/2010/09/24/1833717.html
- hdu-1071-The area
- ok6410学习之触摸屏篇