TCO 2015 Round 1B DIV1 500 概率题

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<queue>
#include<string>
#include<sstream>
#define eps 1e-9
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define FOR(i,j,k) for(int i=j;i<=k;i++)
#define MAXN 1005
#define MAXM 40005
#define INF 0x3fffffff
using namespace std;
typedef long long LL;
int i,j,k,n,m,x,y,T,ans,big,cas,num;
bool flag;
double pa[MAXN];
class TheTips
{
        public:
        double solve(vector <string> c, vector <int> p)
        {
            int n=c.size();
            for (k=0;k<n;k++)
            {
                for (i=0;i<n;i++)
                {
                    for (j=0;j<n;j++)
                    {
                        if (i==j || j==k || i==k) continue;
                        if (c[i][k]==‘Y‘&& c[k][j]==‘Y‘) c[i][j]=‘Y‘;
                    }
                }
            }
            
            for (i=0;i<n;i++) c[i][i]=‘Y‘;
            
            for (i=0;i<n;i++) pa[i]=1;
            //for (i=0;i<n;i++) cout<<c[i]<<endl;
            
            for (j=0;j<n;j++)
            {
                for (i=0;i<n;i++)
                {
                    if (c[i][j]==‘Y‘)
                    {
                        pa[j]*=1-p[i]*0.01;
                    }
                }
            }
            //for (i=0;i<n;i++) printf("%d %f\n",i,pa[i]);
            
            double ans=0;
            for (i=0;i<n;i++)
            {
                ans+=1-pa[i];
            }
            return ans;            
                        
        }            
};