HDU 1217 Arbitrage

Floyd

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>

const int maxn = 30;
const int maxm = 1010;

double d[maxn][maxn];

using namespace std;

int main()
{
    int n,m,i,c=0,j,k;
    double val;
    string s1,s2;
    while(cin>>n,n){
        map<string,int> dict;
        for(i=0;i<n;i++){
            cin>>s1;
            dict[s1]=i;
        }
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                d[i][j]=0;
        cin>>m;
        while(m--){
            cin>>s1>>val>>s2;
            d[dict[s1]][dict[s2]]=val;
        }
        for(k=0;k<n;k++){
            for(i=0;i<n;i++){
                for(j=0;j<n;j++){
                    if(d[i][j]<d[i][k]*d[k][j])
                        d[i][j]=d[i][k]*d[k][j];
                    if(i==j&&d[i][i]>1)
                        break;
                }
                if(j!=n)
                    break;
            }
            if(i!=n)
                break;
        }
        if(k!=n)
            printf("Case %d: Yes\n",++c);
        else
            printf("Case %d: No\n",++c);
    }
    return 0;
}