Play the Dice

1341: Play the Dice

Time Limit: 1 Sec   Memory Limit: 64 MB
Submit: 47   Solved: 15
[ Submit][ Status][ Web Board]

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. End with EOF.
The first line is an integer N (2<=N<=200), following with N integers Ai(0<=Ai<200)
The second line is an integer M (0<=M<=N), following with m integers Bi(1<=Bi<=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" a line without double quotes.

Sample Input

6 1 2 3 4 5 6

0

4 0 0 0 0

1 3

Sample Output

3.50

0.00

摇色子，要到那一面就得到那一面的钱数，如果要到的数在b[i]中出现过，就表示这一面是比较特殊的一面就还可以再摇一次，问最终得到钱数的期望！

这个题本来以为挺难的，因为如果摇到特殊号，就可以再摇，那么再摇的话有可能再摇到此号，循环往复，无休无止……   就相当于递归，但没有终止条件，不知道什么时候终止，那么怎么办呢？！     如果用递归表示这个题的话，还有一个不合适的地方，递归虽然每次函数名都相同，但是内部的参数变量都是不相同的；而这里的变化确实同步的，

就好比int i=3;   a=(++i)+(++i);    a=5+5=10,而不是9，第一次i自增1变成4，第二个参数i变成5，那么第一个参数也变成5了，这里的变化是同步的！

具体解释参考的:

ans=1/N *(A[B[1]]+ans) + 1/N *(A[B[2]]+ans)  + ...1/N *(A[B[M]]+ans) + 1/N A[k]+....

http://www.cnblogs.com/kuangbin/archive/2013/05/16/3082750.html

是特殊值的多加一个ans，不是的就加本身……

#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;

int n,m;
int a,b;
double ans;
double sum;
int main()
{
    while( ~scanf("%d",&n) )
    {
        sum=0;
        for(int i=0;i<n;++i)
        {
            scanf("%d",&a);
            sum+=a;
        }
        scanf("%d",&m);
        for(int i=0;i<m;++i)
        {
            scanf("%d",&b);
        }
        if(n==m)cout<<"inf"<<endl;
        else
        {
             ans=sum/(n-m);
            printf("%.2f\n",ans);

        }
    }
    return 0;
}