poj2240 Arbitrage(floyd)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<algorithm>
using namespace std;

double G[35][35];
int n,M;

void floyd()
{
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(G[i][j]<G[i][k]*G[k][j])
                {
                    G[i][j]=G[i][k]*G[k][j];
                }
            }
        }
    }
}

int main()
{
    //freopen("d:\\test.txt","r",stdin);
    int t=1;
    string s;
    map<string,int>m;
    while(cin>>n&&n)
    {
        for(int i=1;i<=n;i++)
        {
            cin>>s;
            m[s]=i;
            G[i][i]=1;
        }
        cin>>M;
        memset(G,0,sizeof(G));
        for(int i=0;i<M;i++)
        {
            double w;
            string s1,s2;
            cin>>s1>>w>>s2;
            G[m[s1]][m[s2]]=w;
        }
        floyd();
        int ok=0;
        for(int i=1;i<=n;i++)
        {
            if(G[i][i]>1)
            {
                ok=1;
                break;
            }
        }
        if(ok) cout<<"Case "<<t++<<": Yes"<<endl;
        else cout<<"Case "<<t++<<": No"<<endl;
    }
    return 0;
}