题目大意:n 种钱币间进行各种汇率交换,如果能赚就 Yes,否则 No
解题思路:国家为点,汇率为边建图,用 floyd 处理,最终自己到自己的权值大于 1 说明有一个环能赚
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<string>
#include<queue>
#include<map>
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
const int INF = 0x3f3f3f3f;
const int NINF = -INF -1;
const int MAXN = 30+5;
using namespace std;
map<string, int> cty;
double vec[MAXN][MAXN];
int n, m, cnt = 0;
void floyd() {
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (vec[i][j] < vec[i][k]*vec[k][j])
vec[i][j] = vec[i][k]*vec[k][j];
}
int main() {
while (scanf("%d", &n) && n) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
vec[i][j] = 0;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
cty[s] = i;
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
string s1, s2;
double t;
cin >> s1 >> t >> s2;
vec[cty[s1]][cty[s2]] = t;
}
floyd();
int flag = 0;
for (int i = 1; i <= n; i++)
if (vec[i][i] > 1) {
flag = 1;
break;
}
printf("Case %d: ", ++cnt);
if (flag) printf("Yes\n");
else printf("No\n");
}
return 0;
}