POJ--2499--Arbitrage

题目描述：
Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French francs, and 1 French franc buys 0.21 US dollar. Then, by converting currencies, a clever trader can start with 1 US dollar and buy 0.5 * 10.0 * 0.21 = 1.05 US dollars, making a profit of 5 percent.

Your job is to write a program that takes a list of currency exchange rates as input and then determines whether arbitrage is possible or not.
输入描述:
The input will contain one or more test cases. Om the first line of each test case there is an integer n (1<=n<=30), representing the number of different currencies. The next n lines each contain the name of one currency. Within a name no spaces will appear. The next line contains one integer m, representing the length of the table to follow. The last m lines each contain the name ci of a source currency, a real number rij which represents the exchange rate from ci to cj and a name cj of the destination currency. Exchanges which do not appear in the table are impossible.
Test cases are separated from each other by a blank line. Input is terminated by a value of zero (0) for n.
输出描述:
For each test case, print one line telling whether arbitrage is possible or not in the format “Case case: Yes” respectively “Case case: No”.
输入：
3
USDollar
BritishPound
FrenchFranc
3
USDollar 0.5 BritishPound
BritishPound 10.0 FrenchFranc
FrenchFranc 0.21 USDollar

3
USDollar
BritishPound
FrenchFranc
6
USDollar 0.5 BritishPound
USDollar 4.9 FrenchFranc
BritishPound 10.0 FrenchFranc
BritishPound 1.99 USDollar
FrenchFranc 0.09 BritishPound
FrenchFranc 0.19 USDollar

0
输出：
Case 1: Yes
Case 2: No
题意：
有些人会利用货币的不用汇率来进行套现，比如1美元换0.5英镑，而1英镑又可以换10法郎，而1法郎又可以换0.21的美元，那么经过货币的汇率转换后，它就可以获得1.05倍原来的美元。
现在给你N中货币，m种货币的汇率，求是否可以获利。
题解：
map记录后floyd直接搞
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;

const int maxn = 100 + 5;
double g[maxn][maxn];

int main(){
    int n,m;
    int cas = 1;
    while(scanf("%d",&n)!=EOF){
        map<string,int> mp;
        string name;
        if(n == 0) break;
        memset(g,0,sizeof(g));
        for(int i = 1; i <= n; i ++){
            cin>>name;
            mp[name] = i;
        }
        scanf("%d",&m);
        string op1,op2;
        double v;
        for(int i = 1; i <= m; i ++){
            cin>>op1>>v>>op2;
            g[mp[op1]][mp[op2]] = v;
        }
        for(int k = 1; k <= n; k ++){
            for(int i = 1; i <= n; i ++){
                for(int j = 1; j <= n; j ++){
                    g[i][j] = max(g[i][j],(g[i][k] * g[k][j]));
                }
            }
        }
        bool flag = false;
        for(int i = 1; i <= n; i ++){
            if(g[i][i] > 1) flag = true;
        }
        if(flag) printf("Case %d: Yes\n",cas ++);
        else printf("Case %d: No\n",cas ++);
    }
    return 0;
}