题目链接
http://acm.hdu.edu.cn/showproblem.php?pid=4652
题意
询问0mn,1mn。
0mn代表m面骰子投出连续n个相同期望次数
1mn代表m面骰子投出连续n个各不相同期望次数
思路
期望DP
一卷数列压轴
话不多说看图
教训/收获
TMD
代码
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<chrono>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
//#define int long long
//#define double long double
using namespace std;
typedef long long ll;
const int maxn=100010;
const int inf=0x3f3f3f3f;
int n,m,k;
double dp[maxn];
int tp[maxn];
signed main(){
IOS
#ifndef ONLINE_JUDGE
freopen("IO\\in.txt","r",stdin);
freopen("IO\\out.txt","w",stdout);
#endif
int tn=1;
while(cin>>n){
while(n--){
int a,b,c;
cin>>a>>b>>c;
if(!a){
cout<<fixed<<setprecision(9)<<(1.0-pow(b,c))/(1.0-b)<<endl;
}
else{
double p=1;
double ans=1;
for(int i=2;i<=c;i++){
p=((b+0.0)/(b-i+1.0))*p;
ans+=p;
}
cout<<fixed<<setprecision(9)<<ans<<endl;
}
}
}
return 0;
}