HDU 4870 Rating 概率DP

时间：2015-08-30 20:52:13 阅读：148 评论：0 收藏：0 [点我收藏+]

标签：

Rating

Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

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

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int i,j;
 9     double dp[22],p,ans[25][25];
10     while(scanf("%lf",&p)!=EOF)
11     {
12         dp[0]=1.0/p;
13         dp[1]=1.0/p/p;
14         ans[0][0]=0;
15         for(i=2;i<20;i++)
16         {
17             dp[i]=1.0/p+(1.0-p)/p*(dp[i-2]+dp[i-1]);
18         }
19         for(i=0;i<20;i++)
20         {
21             ans[i+1][i]=ans[i][i]+dp[i];
22             ans[i+1][i+1]=ans[i+1][i]+dp[i];
23         }
24         printf("%lf\n",ans[20][19]);
25     }
26     return 0;
27 }

View Code

HDU 4870 Rating 概率DP

标签：

原文地址：http://www.cnblogs.com/cyd308/p/4771431.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行