lightoj 1030 - Discovering Gold 【期望】
来源:互联网 发布:淘宝上好的女鞋外贸店 编辑:程序博客网 时间:2024/05/16 14:58
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 Nthposition 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 ithinteger 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 <cstring>#include <cmath>#include <cstdlib>#include <algorithm>#include <queue>#include <stack>#include <map>#include <vector>#define INF 0x3f3f3f3f#define eps 1e-8#define MAXN (3000+10)#define MAXM (50000000)#define Ri(a) scanf("%d", &a)#define Rl(a) scanf("%lld", &a)#define Rf(a) scanf("%lf", &a)#define Rs(a) scanf("%s", a)#define Pi(a) printf("%d\n", (a))#define Pf(a) printf("%lf\n", (a))#define Pl(a) printf("%lld\n", (a))#define Ps(a) printf("%s\n", (a))#define W(a) while(a--)#define CLR(a, b) memset(a, (b), sizeof(a))#define MOD 1000000007#define LL long long#define lson o<<1, l, mid#define rson o<<1|1, mid+1, r#define ll o<<1#define rr o<<1|1using namespace std;int gcd(int a, int b){ return b == 0 ? a : gcd(b, a%b);}double dp[110], num[110];int main(){ int t, kcase = 1; Ri(t); W(t) { int n; Ri(n); for(int i = 0; i < n; i++) Rf(num[i]), dp[i] = num[i]; for(int i = n-2; i >= 0; i--) { int choose = min(6, n - i - 1); for(int j = 1; j <= choose; j++) dp[i] += dp[i+j] / (double)choose; } printf("Case %d: %.7lf\n", kcase++, dp[0]); } return 0;}
- lightoj 1030 Discovering Gold[ 期望 ]
- LightOJ - 1030 Discovering Gold 期望
- lightoj 1030 - Discovering Gold 【期望】
- LightOJ 1030 Discovering Gold(期望)
- 【期望dp】LightOJ 1030 Discovering Gold
- LightOJ 1030 - Discovering Gold (期望dp)
- LightOJ 1030 Discovering Gold(期望DP)
- 【LightOJ 1030】Discovering Gold(期望DP)
- lightoj 1030 Discovering Gold 概率期望
- 【概率&期望】Discovering Gold LightOJ
- LightOJ 1030 Discovering Gold
- LightOJ 1030-Discovering Gold
- LightOJ 1030 Discovering Gold
- lightoj 1030 Discovering Gold
- lightoj 1030 Discovering Gold
- LightOJ 1030 Discovering Gold
- Lightoj 1030 - Discovering Gold
- LightOj-1030-Discovering Gold
- 网站的基本构成及知识存储
- javascript函数的调用种类
- [Microsoft][ODBC 驱动程序管理器] 在指定的 DSN 中,驱动程序和应用程序之间的体系结构不匹配
- 关于hive数据库查询操作出现的空指针问题
- $(function(){})与window.onload=function(){}的区别
- lightoj 1030 - Discovering Gold 【期望】
- 替换Android的应用图标
- Unity3d中 Awake 和 Start的区别
- 怎样写参数个数可变的宏
- 网上商城项目实战之需求分析
- lamba表达式 c++
- Play Framework 框架的控制器(Controller)
- Android Camera框架
- HDU 5515 Game of Flying Circus (2015沈阳G题&&二分模拟)