POJ -2240 Arbitrage（Bellman-Ford，判正环）

Arbitrage
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 31732 Accepted: 13184
Description
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.

Input
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.

Output
For each test case, print one line telling whether arbitrage is possible or not in the format “Case case: Yes” respectively “Case case: No”.

Sample Input
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

Sample Output
Case 1: Yes
Case 2: No

题意：n种钱，m种兑换方式，问经过几次兑换后能不能赚钱。
这里用序号代替钱的种类，判断正环是否存在。
POJ -1860 Currency Exchange（Bellman-Ford，判正环）

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define eps 1e-8
#define INF 0x3f3f3f3f
const int N=35;

struct date
{
    int a, b;
    double r;
};
date ee[N*N];

double dist[N];
int n, m;
int Case;
int st, en;

int bellman_ford()
{
    for(int i = 1; i <= n; i++)
        dist[i] = 0;
    dist[st] = 1;
    for(int k = 0; k < n; k++)
        for(int i = 0; i < m; i++)
        {
            if(dist[ee[i].b] < dist[ee[i].a] * ee[i].r)
                dist[ee[i].b] = dist[ee[i].a] * ee[i].r;
        }
    for(int i = 0; i < m; i++)
        if(dist[ee[i].b] < dist[ee[i].a] * ee[i].r)
            return 1;
    return 0;
}


int main()
{
    char type[30], a[30], b[30];
    double rate;
    Case=1;
    while(scanf("%d",&n), n)
    {
        st=1;
        map<string, int> Map;
        for(int i=1; i<=n; i++)//将字符串序号化
        {
            scanf("%s", type);
            Map[type]=i;;
        }
        scanf("%d", &m);
        for(int i=0; i<m; i++)
        {
            scanf("%s%lf%s", a, &rate, b);
            int u=Map[a], v=Map[b];
            ee[i].a=u, ee[i].b=v, ee[i].r=rate;
        }
        int ans=bellman_ford();
        if(ans)
            printf("Case %d: Yes\n", Case++);
        else
            printf("Case %d: No\n", Case++);
        Map.clear();
    }
    return 0;
}