poj_2240

此题不难，套一下稍微改变的Floyd算法就行，因为没要求起点，所以我们计算下全局的最长路，看看最后回到自己本身以后路径长度是否大于初始的1.0即可。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-10
#define INF 0x7fffffff
#define inf 0x3f3f3f3f
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
int n,m;
int s;
#define N 210
map<string,int> mp;
double rate[35][35];
int vis[N];
int id;
void Floyd(){
    for(int k=1;k<=id;k++)
        for(int i=1;i<=id;i++)
            for(int j=1;j<=id;j++){
                if(rate[i][j]<rate[i][k]*rate[k][j])
                    rate[i][j] = rate[i][k]*rate[k][j];
            }
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    int kas = 1;
    while(scanf("%d",&n)!=EOF && n){
        char name[110];
        char name1[110];
        double rt;
        mp.clear();
        id = 0;
        for(int i=0;i<n;i++){
            sfs(name);
            mp[name] = ++id;
        }
        sf(m);
        int id1,id2;
        for(int i=1;i<=id;i++)
            rate[i][i] = 1.0;
        for(int i=0;i<m;i++){
            scanf("%s%lf%s",name,&rt,name1);
            id1 = mp[name];
            id2 = mp[name1];
            rate[id1][id2] = rt;
        }
        Floyd();
        int flag = 0;
        for(int i=1;i<=id;i++)
            if(rate[i][i]>1.0) flag = 1;
        printf("Case %d: ",kas++);
        if(flag)
            printf("Yes\n");
        else
            printf("No\n");
    }
return 0;
}