大家好，又见面了，我是全栈君，今天给大家准备了Idea注册码。
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.000000 0.814700
Sample Output
39.000000 82.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; }
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/116723.html原文链接：https://javaforall.net
