lightoj1030 - Discovering Gold【概率dp求期望】
来源:互联网 发布:字母logo在线设计软件 编辑:程序博客网 时间:2024/05/16 12:26
You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.
Initially you are in position 1. Now each turn you throw a perfect 6 sided dice. If you get X in the dice after throwing, you add X to your position and collect all the gold from the new position. If your new position is outside the cave, then you keep throwing again until you get a suitable result. When you reach the Nth position you stop your journey. Now you are given the information about the cave, you have to find out the expected number of gold you can collect using the given procedure.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case contains a blank line and an integer N (1 ≤ N ≤ 100) denoting the dimension of the cave. The next line contains N space separated integers. The ith integer of this line denotes the amount of gold you will get if you come to the ith cell. You may safely assume that all the given integers will be non-negative and no integer will be greater than 1000.
Output
For each case, print the case number and the expected number of gold you will collect. Errors less than 10-6 will be ignored.
Sample Input
Output for Sample Input
3
1
101
2
10 3
3
3 6 9
Case 1: 101.0000000000
Case 2: 13.000
Case 3: 15
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<list>#include<queue>#include<vector>using namespace std;double dp[110],num[110];int main(){int t,i,j,k=1,n;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=1;i<=n;++i){scanf("%lf",&num[i]);}memset(dp,0,sizeof(dp));dp[n]=num[n];for(i=n-1;i>=1;--i){for(j=1;j<=6;++j){if(n-i<=6){dp[i]+=dp[i+j]*(1.0/(1.0*(n-i)));}else {dp[i]+=dp[i+j]*1.0/6.0;}}dp[i]+=num[i];}printf("Case %d: %.6lf\n",k++,dp[1]);}return 0;}
- lightoj1030 - Discovering Gold【概率dp求期望】
- LightOJ1030---Discovering Gold(概率dp)
- LightOJ1030- Discovering Gold(期望dp)
- LightOJ1030-Discovering Gold-dp
- lightoj 1030 Discovering Gold 概率dp求期望
- 【概率&期望】Discovering Gold LightOJ
- LightOJ1030-Discovering Gold
- lightoj 1030 Discovering Gold 概率期望
- 【期望dp】LightOJ 1030 Discovering Gold
- LightOJ 1030 - Discovering Gold (期望dp)
- LightOJ 1030 Discovering Gold(期望DP)
- lightOJ Discovering Gold(期望DP入门)
- 【LightOJ 1030】Discovering Gold(期望DP)
- 1030 - Discovering Gold (lightoj 1030 概率DP)
- lightoj 1030 Discovering Gold (基础概率dp)
- [LightOJ 1030] Discovering Gold (概率DP)
- lightoj 1030discovering gold(概率dp)
- 概率dp LightOJ 1030 Discovering Gold
- FreeBSD文件编辑vi指令大全
- javascript console函数详解js开…
- firefox插件Firebug的使用教程
- FireFox使用Firebug进行断点调试图…
- PHP调试时print_r,var_dump…
- lightoj1030 - Discovering Gold【概率dp求期望】
- JS获取几种URL地址的方法小结
- FreeBSD 编辑器VI使用方法
- FreeBSD系统ee编辑器快捷键一览表
- FreeBSD的Ports系统
- PHP中ereg与preg_match和preg_matc…
- 判断汉字的正则表达式(转)
- PHP生成随机密码的4种方法及性能对…
- PHP生成随机密码的4种方法及性能对…