Play the Dice
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 300 Accepted Submission(s): 134
Special Judge
Problem Description
There is a dice with n sides, which are numbered from 1,2,...,n and have the equal possibility to show up when one rolls a dice. Each side has an integer ai on it. Now here is a game that you can roll this dice once, if the i-th side is up, you will get ai yuan. What's more, some sids of this dice are colored with a special different color. If you turn this side up, you will get once more chance to roll the dice. When you roll the dice for the second time, you still have the opportunity to win money and rolling chance. Now you need to calculate the expectations of money that we get after playing the game once.
Input
Input consists of multiple cases. Each case includes two lines.
The first line is an integer n (2<=n<=200), following with n integers a i(0<=a i<200)
The second line is an integer m (0<=m<=n), following with m integers b i(1<=b i<=n), which are the numbers of the special sides to get another more chance.
The first line is an integer n (2<=n<=200), following with n integers a i(0<=a i<200)
The second line is an integer m (0<=m<=n), following with m integers b i(1<=b i<=n), which are the numbers of the special sides to get another more chance.
Output
Just a real number which is the expectations of the money one can get, rounded to exact two digits. If you can get unlimited money, print inf.
Sample Input
6 1 2 3 4 5 6 0 4 0 0 0 0 1 3
Sample Output
3.50 0.00
Source
Recommend
zhuyuanchen520
本题给定一个色子各个面的价值和规定其中若干个可以获得该面价值并获得再掷一次的机会,求最后获得价值的期望。
本题是个概率题,要求期望。我们可以找方程。设Exp为该期望,则Exp=sum/n+num/n*Exp
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN=200+10;
int val[MAXN];
bool visited[MAXN];
int main()
{
int n,i,m,sum,id,cnt;
while(~scanf("%d",&n))
{
sum=0;
memset(visited,0,sizeof(visited));
for(i=1;i<=n;i++)
{
scanf("%d",&val[i]);
sum+=val[i];
}
scanf("%d",&m);
cnt=0;
for(i=0;i<m;i++)
{
scanf("%d",&id);
if(!visited[id])
{
visited[id]=true;
cnt++;
}
}
if(m>=n&&sum>0)printf("inf\n");
else if(m>=n)printf("0.00\n");
else printf("%.02lf\n",sum*1.0/(n-cnt));
}
return 0;
}