白书例题 uva 11021 Tribles
2015-04-27 20:48
260 查看
#include<iostream> #include<sstream> #include<cstdio> #include<cstring> #include<cmath> #include<queue> #include<stack> #include<math.h> #include<map> #include<time.h> #include<set> #include<string> #include<vector> #include<algorithm> using namespace std; #define inf 0x7fffffff #define lc l,m,index<<1 #define rc m+1,r,index<<1|1 #define max_n 4000005 #define mod 100000007 #define LL long long #define max_log 20 int n,m,k; double p[max_n]; double f[max_n]; int main() { int T; int Tcase=1; scanf("%d",&T); while(T--) { scanf("%d%d%d",&n,&k,&m); for(int i=0;i<n;i++) scanf("%lf",&p[i]); f[0]=0; f[1]=p[0]; for(int i=2;i<=m;i++) { f[i]=0; for(int j=0;j<n;j++)f[i]+=p[j]*pow(f[i-1],j); } printf("Case #%d: ",Tcase++); printf("%.7lf\n",pow(f[m],k)); } return 0; }
相关文章推荐
- uva 11021 Tribles (概率,递推)
- Uva 11021-Tribles(概率+递推)
- [UVA]11021 Tribles
- UVA - 11021 Tribles 概率dp
- UVa 11021 Tribles(概率DP)
- UVA - 11021 - Tribles 递推概率
- uva 11021 Tribles
- uva 11021 Tribles 【概率】
- Uva 11021 Tribles
- uva 11021 - Tribles(概率)
- UVA 11021 C - Tribles(概率DP)
- UVA 11021 - Tribles
- UVA 11021 - Tribles(概率递推)
- UVA 11021 - Tribles (数学概率)
- UVA_11021 Tribles(递推)
- UVA 11021 - Tribles
- UVA 11021 Tribles(递推+概率)
- 概率dp - UVA 11021 Tribles
- UVA 11021 - Tribles (数学概率)
- UVA 11021 Tribles (概率dp)