HDU 1217 Arbitrage

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <map>

using namespace std;
const int MAXN = 32;

map<string, int> SIMap;
double mat[MAXN][MAXN];
int n, m, cas = 0;

void init()
{
    cas++;
    SIMap.clear();
    memset(mat, 0, sizeof(mat));
    for (int i = 0; i < MAXN; ++i)
        mat[i][i] = 1;
}

void floyd()
{
    for (int k = 0; k < n; ++k)
    {
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                if (mat[i][k] == 0 || mat[k][j] == 0) continue;
                if (mat[i][j] < mat[i][k] * mat[k][j])
                    mat[i][j] = mat[i][k] * mat[k][j];
            }
        }
    }
}

void input()
{
    double rate;
    string s, s1, s2;
    
    for (int i = 0; i < n; ++i)
    {
        cin>>s;
        SIMap[s] = i;
    }
    cin>>m;
    for (int i = 0; i < m; ++i)
    {
        cin>>s1>>rate>>s2;
        mat[SIMap[s1]][SIMap[s2]] = rate;
    }
}

bool judge()
{
    for (int i = 0; i < n; ++i)
    {
        if (mat[i][i] > 1.0) 
            return true;
    }
    return false;
}

int main()
{
    while (cin>>n && n)
    {
        init();
        input();
        floyd();
        
        if (judge())
            printf("Case %d: Yes\n", cas);
        else
            printf("Case %d: No\n", cas);
    }
    return 0;
}