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.
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
题目大意:
给出一个n,表示有一个正n面形,然后给出每个面的得分。接着是m,表示丢到哪些面后可以获得再掷一次的机会,问说得分的期望。
解题思路:
由于是无限,我们可以看作是
只考虑第一次,获得的金币的平均值为sum/n.sum为所有色子的面的金币值相加。
对于运气好,摇中了可以再来一次,该轮就能获得m/n*(sum/n)
运气好,又再来一次,该轮能获得(m/n)^2*(sum/n)
无穷无尽的摇下去,一共能获得sum/n*(1+p + p^2+`````+p^k + ````),其中p = m/n
将式子化简,就能得到E = sum/(n-m)。所以当sum = 0时为0,n=m时为inf。其余就为sum/(n-m)。
不过这个题目需要特判,如果sum=0首先输出0.00,然后是n==m,输出inf。因为题目会卡你sum==0且n==m这组答案。
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
float a;
float sum;
int n,m;
while(~scanf("%d",&n))
{
sum=0;
for(int i=0;i<n;i++)
{
scanf("%f",&a);
sum+=a;
}
scanf("%d",&m);
for(int i=0;i<m;i++)
{
scanf("%f",&a);
}
if(sum==0)
printf("0.00\n");
else if(n==m)
printf("inf\n");
else
{
float b=sum/(n-m);
printf("%.2f\n",b);
}
}
return 0;
}