期望DP——（HDU6658）The Moon

题目

he Moon card shows a large, full moon in the night’s sky, positioned between two large towers. The Moon is a symbol of intuition, dreams, and the unconscious. The light of the moon is dim, compared to the sun, and only vaguely illuminates the path to higher consciousness which winds between the two towers.

Random Six is a FPS game made by VBI(Various Bug Institution). There is a gift named “Beta Pack”. Mr. K wants to get a beta pack. Here is the rule.
Step 0. Let initial chance rate qq = 2%.
Step 1. Player plays a round of the game with winning rate pp.
Step 2. If the player wins, then will go to Step 3 else go to Step 4.
Step 3. Player gets a beta pack with probability qq. If he doesn’t get it, let qq = min(100%, qq + 2%) and he will go to Step 1.
Step 4. Let qq = min(100%, qq + 1.5%) and goto Step 1.
Mr. K has winning rate pp% , he wants to know what’s the expected number of rounds before he needs to play.

Input
The first line contains testcase number TT (TT ≤ 100). For each testcase the first line contains an integer pp (1 ≤ pp ≤ 100).

Output
For each testcase print Case ii : and then print the answer in one line, with absolute or relative error not exceeding 1e6.

Sample Input
2
50
100

Sample Output
Case 1: 12.9933758002
Case 2: 8.5431270393

题意

假设玩一个游戏，每局都有P%的概率能赢（P已知），初始中奖率为Q=2%；赢的时候可以抽奖，如果中奖了就结束游戏，如果没中奖Q+2%；输的时候不抽奖，Q+1.5%。

解析

正确代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
using namespace std;
int main()
{
    double a[205];
    int t;
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        memset(a,0,sizeof(a));
        double p;
        scanf("%lf",&p);
        p/=100;
        a[200]=1/p;
        for(int q=199;q>=1;q--) a[q]=p*(a[min(q+4,200)]*(1-q/200.0)+1)+(1-p)*(a[min(q+3,200)]+1);
        printf("Case %d: %.10f\n",i,a[4]);
    }
    return 0;
}