LightOJ
来源:互联网 发布:手机sd卡数据恢复 编辑:程序博客网 时间:2024/05/16 23:29
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
3
1
101
2
10 3
3
3 6 9
Sample Output
Case 1: 101.0000000000
Case 2: 13.000
Case 3: 15
就很水
#include<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;double dp[101],tu[101];int main(){ int u=0; int n; int T; cin >> T; while (T--) { cin >> n; memset(dp, 0, sizeof(dp)); for (int a = 1; a <= n; a++)cin >> tu[a]; for (int a = n; a >= 1; a--) { dp[a] += tu[a]; int ds = min(a+6, n)-a; for (int b = 1; b <= ds; b++) { dp[a] += dp[a+b] / ds; } } printf("Case %d: %.7f\n", ++u, dp[1]); }}
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- [LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- 读《爷爷的幸福口令》
- VC++不自动退格
- 关于PackageInfo、ApplicationInfo、ActivityInfo、ResolveInfo四种信息类的区别之我见
- 51Nod 1020 逆序排列
- Exoplayer+Exomedia之玩转视频播放事件监听
- LightOJ
- iOS开发学习笔记----objective-c之block初探
- FFMPEG学习【libavutil】:Crypto and Hashing(一)
- Objective-C消息机制的原理
- iOS学习笔记——UIViewController学习
- CoreData的简单使用
- HTTP请求报文和HTTP响应报文
- 【R的机器学习】模型性能提升探索:朴素贝叶斯
- 谷歌浏览器访问网站提示“您要访问的网站包含恶意软件”