【DP】 Codeforces Round #293 (Div. 2) D. Ilya and Escalator

dp[i][j]表示经过j秒走了i个人，然后转移也很简单。。。。

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 2005
#define maxm 100005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

double dp[maxn][maxn];
double p;
int n, t;

void read()
{
	scanf("%d%lf%d", &n, &p, &t);
}

void work()
{
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= t; j++)
			dp[i][j] = (dp[i-1][j-1] + 1) * p + dp[i][j-1] * (1 - p);
	printf("%.9f\n", dp[n][t]);
}

int main()
{
	read();
	work();
	

	return 0;
}