Ilya got tired of sports programming, left university and got a job in the subway. He was given the task to determine the escalator load factor.
Let's assume that n people stand in the queue for the escalator. At each second one of the two following possibilities takes place: either the first person in the queue enters the escalator with probability p, or the first person in the queue doesn't move with probability (1 - p), paralyzed by his fear of escalators and making the whole queue wait behind him.
Formally speaking, the i-th person in the queue cannot enter the escalator until people with indices from 1 to i - 1 inclusive enter it. In one second only one person can enter the escalator. The escalator is infinite, so if a person enters it, he never leaves it, that is he will be standing on the escalator at any following second. Ilya needs to count the expected value of the number of people standing on the escalator after t seconds.
Your task is to help him solve this complicated task.
The first line of the input contains three numbers n, p, t (1 ≤ n, t ≤ 2000, 0 ≤ p ≤ 1). Numbers n and t are integers, number p is real, given with exactly two digits after the decimal point.
Print a single real number — the expected number of people who will be standing on the escalator after t seconds. The absolute or relative error mustn't exceed 10 - 6.
1 0.50 1
0.5
1 0.50 4
0.9375
4 0.20 2
0.4
题目大意:
一共有n个人站成一队 ,一共有t秒,每秒第一个人有p概率上电梯,有(1-p)概率不上电梯。
问t秒结束时,上电梯的期望人数(t秒时,每种可能的人数*出现这种人数的概率 累加=t秒时的期望人数)。
AC代码:
#include <cstdio>
#include <cstring>
double dp[2005][2005]; //dp[i][j]是第i秒电梯里有j个人的概率
int main()
{
int n, t;
double p, ans = 0;
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
scanf("%d %lf %d", &n, &p, &t);
for(int i = 1; i <= t; i++)
{
for(int j = n; j >= 0; j--)
{
if(j == n)
//第i秒有n个人的概率=第i-1秒有j-1个人的概率*第i秒第j个人进电梯的概率+第i - 1秒电梯就已经有n个人的概率(那么第i+1秒一定有n个人,概率为1)
dp[i][j] = dp[i - 1][j - 1] * p + dp[i - 1][j];
else if(j != 0)
//这里dp[i - 1][j]*(1 - p)表示第i秒时排头的人不进电梯
dp[i][j] = dp[i - 1][j - 1] * p + dp[i - 1][j] * (1 - p);
else
//第i秒电梯里没人的概率=第i-1秒电梯里没人的概率*(1 - p),表示第i秒时排头的人不进电梯
dp[i][j] = dp[i - 1][j] * (1 - p);
}
}
for(int i = 1; i <= n; i++)
ans += (dp[t][i] * i); //期望=每种在t秒时可能有的人数*出现这种人数的概率 累加(每种情况乘以对应的概率)
printf("%.7f\n", ans); //保证误差不超过10 - 6.
}