hdu1217 floyd

题意：给几个国家，然后给这些国家之间的汇率。判断能否通过这些汇率差进行套利交易。就是经过一系列汇率转化，是否出现有币值升值。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <map>
#define N 1005

const double INF = 1e-10;

using namespace std;

int m, n;
double mapp[N][N];

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

int main()
{
	int cas = 0;
	while (scanf("%d%d", &n) != EOF && n)//n个顶点，m条边
	{
		//字符串转化为数字
		map<string, int> v1;
		string s;
		for (int i = 1; i <= n; i++)
		{
			cin >> s;
			v1[s] = i;
		}

		//初始化
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				if (i == j)	mapp[i][j] = 1.0;
				else mapp[i][j] = 0;
			}
		}

		//输入有向边
		scanf("%d", &m);
		string s1, s2;
		double w;
		for (int i = 1; i <= m; i++)
		{
			cin >> s1 >> w >> s2;
			mapp[v1[s1]][v1[s2]] = w;
		}

		floyed();//核心弗洛伊德算法

		int flag = 0;
		for (int i = 1; i <= n; i++)
		{
			if (mapp[i][i] > 1) { flag = 1; break; }
		}
		
		printf("Case %d: ", ++cas);
		if (flag)	printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}