poj_2240

题目链接：http://poj.org/problem?id=2240

这道题目跟上一道差不多，也是用Floyd就可以，不过要注意下初始化，这里是有实际意义的，比如当i=j时，那么说明是同一种货币，此时的汇率为1.0，否则的话就为0.0，松弛条件是if(price[i][j]<price[i][k]*price[k][j]) price[i][j]=price[i][k]*price[k][j]

#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-8
#define INF 0x7fffffff
#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))
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;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 1010
#define M 1000010
double price[110][110];
char name[N];
char name1[N];
map<string,int> mp;
void Init(){
	mp.clear();
	for(int i=0;i<110;i++)
		for(int j=0;j<110;j++){
			price[i][j] = (i==j?1.0:0.0);
		}
}
int Floyd(){
	for(int k=1;k<=n;k++)
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++){
				if(price[i][j]<price[i][k]*price[k][j]){
					price[i][j] = price[i][k]*price[k][j];
				}
			}
	for(int i=1;i<=n;i++){
		if(price[i][i] > 1.0)
			return 1;
	}
	return 0;
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    int kas=1;
	while (sf(n) != EOF && n) {
		Init();
		for(int i=1;i<=n;i++){
			sfs(name);
			mp[name] = i;
		}
		sf(m);
		double rate;
		for(int i=0;i<m;i++){
			scanf("%s%lf%s",name,&rate,name1);
			price[mp[name]][mp[name1]] = rate;
		}
		printf("Case %d: ",kas++);
		if(Floyd())
			printf("Yes\n");
		else
			printf("No\n");

	}
return 0;
}