zoj 3392
来源:互联网 发布:数据库中删除表的信息 编辑:程序博客网 时间:2024/05/12 12:29
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3329
There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces. Die2 has K2 faces. Die3 has K3 faces. All the dice are fair dice, so the probability of rolling each value, 1 to K1, K2, K3 is exactly 1 / K1, 1 / K2 and 1 / K3. You have a counter, and the game is played as follow:
- Set the counter to 0 at first.
- Roll the 3 dice simultaneously. If the up-facing number of Die1 is a, the up-facing number of Die2 is b and the up-facing number of Die3 is c, set the counter to 0. Otherwise, add the counter by the total value of the 3 up-facing numbers.
- If the counter's number is still not greater than n, go to step 2. Otherwise the game is ended.
Calculate the expectation of the number of times that you cast dice before the end of the game.
Input
There are multiple test cases. The first line of input is an integer T (0 < T <= 300) indicating the number of test cases. Then T test cases follow. Each test case is a line contains 7 non-negative integers n, K1, K2, K3, a, b, c (0 <= n <= 500, 1 < K1, K2, K3 <= 6, 1 <= a <= K1, 1 <= b <= K2, 1 <= c <= K3).
Output
For each test case, output the answer in a single line. A relative error of 1e-8 will be accepted.
Sample Input
20 2 2 2 1 1 10 6 6 6 1 1 1
Sample Output
1.1428571428571431.004651162790698
#include <iostream>#include <string.h>#include <string>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;double aa[1000],bb[1000];double p[100];int main(){ int T,n,k1,k2,k3,a,b,c; cin>>T; while(T--) { cin>>n>>k1>>k2>>k3>>a>>b>>c; memset(aa,0,sizeof(aa)); memset(bb,0,sizeof(bb)); memset(p,0,sizeof(p)); double p0=1.0/(k1*k2*k3); //转化为E[0]的概率; int s=k1+k2+k3; for(int i=1;i<=k1;i++) for(int j=1;j<=k2;j++) for(int k=1;k<=k3;k++) { if(i==a&&j==b&&k==c)continue; p[i+j+k]+=p0; } for(int i=n;i>=0;i--) { for(int j=3;j<=s;j++) { aa[i]+=p[j]*aa[i+j]; bb[i]+=p[j]*bb[i+j]; } aa[i]+=p0; bb[i]+=1; } printf("%.15lf\n",bb[0]/(1-aa[0])); } return 0;}
- zoj 3392
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- 10月16日金银投资交易策略
- eclipse快捷键冲突处理
- ios 手势事件
- 从零开始学android<AudioManager 声音编辑器.五十.>
- iperf
- zoj 3392
- ubuntu设置系统时间与网络时间同步
- What you should know about Stored Procedure Universe in BI 4.0 ?
- 无题
- 测试驱动开发与软件重构
- 导入数据的时候不确定,是否有外键约束,可以通过设置使系统在commit是在做检查。
- 安卓命名规范
- ORACLE 中ROWNUM用法总结
- mac os重定向端口