lightoj 1030 Discovering Gold
2016-05-04 23:41
381 查看
1030 - Discovering Gold
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.
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.
计算数学期望,用dp数组保存到达该点的概率,那么该点的数学期望就是概率乘上该点的金矿数;
PDF (English) | Statistics | Forum |
Time Limit: 2 second(s) | Memory Limit: 32 MB |
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<iostream> #include<cstdlib> #include<string> #include<algorithm> #include<cstdio> #include<cmath> #include<cstring> #include<stack> #include<queue> #include<iomanip> #include<map> #include<set> #include<functional> #define pi 3.14159265358979323846 using namespace std; int cave[105]; double dp[105]; int main() { int T,N,cnt=0; scanf("%d",&T); while(T--) { scanf(" %d",&N); memset(dp,0,sizeof(dp)); dp[0]=1; for(int i=0;i<N;++i) { scanf("%d",&cave[i]); } double sum=0; for(int i=0;i<N;++i) { if(i==0||i==N-1) sum+=cave[i]; else sum+=cave[i]*dp[i]; int temp=1; while(i+temp<N-1) { ++temp; } if(temp>6) temp=6; for(int j=1;j<=temp;++j) { dp[i+j]+=1.0/(temp*1.0)*dp[i]; } } printf("Case %d: %.10lf\n",++cnt,sum); } return 0; }
相关文章推荐
- Go语言开发环境搭建for Windows
- Google Play Store如何换区
- Django自定义用户认证
- A New Discrete-Time Iterative Adaptive Dynamic Programming Algorithm Based on Q-Learning
- HDU 1397 Goldbach's Conjecture(素数判断)
- paper4—Multi-MPE_Trigger_Algorithm—testing
- paper4—Multi-MPE_Trigger_Algorithm
- paper3—Algorithm2-Engine-Trigger-on-SMD—temp
- paper3—Algorithm1-Engine-Trigger-on-FCD—temp
- POJ 2195 Going Home(最小权匹配、KM算法)
- Spark组件之GraphX学习15--we-Google.txt大图分析
- Django笔记:1.创建一个项目
- 使用visual studio code开发Go程序
- Go--基础知识学习二
- 在Visual Studio Code中配置GO开发环境
- Windows环境下vscode-go安装笔记
- Leangoo大讲堂:免费Scrum敏捷开发实战—武汉站
- GO--基础知识学习一
- Go 性能优化技巧 9/10
- Go 性能优化技巧 8/10