hdu 1217 Arbitrage

最新推荐文章于 2020-02-07 11:05:28 发布

风吹过的烟花

最新推荐文章于 2020-02-07 11:05:28 发布

阅读量272

点赞数 1

分类专栏： ACM算法_最短路文章标签：最短路

本文链接：https://blog.csdn.net/zhang__liuchen/article/details/78627553

版权

ACM算法_最短路专栏收录该内容

10 篇文章 0 订阅

订阅专栏

点击打开链接

Arbitrage

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8852 Accepted Submission(s): 4080

Problem 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 file 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

题不是很难，但是错了好多次，都快崩溃了，需要注意的是double,不是int。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
double cost[50][50];
int n,m;
int main()
{
    map<string,int>ff;
    string s,e;
    int ca=1;
    double x;
    while(scanf("%d",&n),n)
    {
        for(int i=0; i<=n; i++)
        {
            for(int j=0; j<=n; j++)
                cost[i][j]=0;
            cost[i][i]=1;
        }
        for(int i=1; i<=n; i++)
        {
            cin>>s;
            ff[s]=i;
        }
        scanf("%d",&m);
        for(int i=1; i<=m; i++)
        {
            cin>>s>>x>>e;
            cost[ff[s]][ff[e]]=x;
        }
        for(int k=1; k<=n; k++)//Floyed算法
        {
            for(int i=1; i<=n; i++)
            {
                for(int j=1; j<=n; j++)
                    cost[i][j]=max(cost[i][j],cost[i][k]*cost[k][j]);
            }
        }
        bool flag=false;
        for(int i=1; i<=n; i++)
            if(cost[i][i]>1)
            {
                flag=true;
                break;
            }
        if(flag)
            printf("Case %d: Yes\n",ca++);
        else
            printf("Case %d: No\n",ca++);
        //system("pause");
    }
    return 0;
}