POJ 2240 Arbitrage floyd

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


这个题要理解好题意T^T反正我是第一遍没想到求[i][i]>1.0即可 注意与下一篇的比较

#include <iostream>
#include <cstdio>
#include<map>
#include <string.h>
using namespace std;
map<string,int>mat;
double dist[100][100];
int n,m;
void Floyd()
{
     for(int k=1;k<=n;k++)
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(dist[i][k]*dist[k][j]>dist[i][j])
                {
                    dist[i][j]=dist[i][k]*dist[k][j];
                   // pre[i][j]=k;
                }
            }
        }

}
int main()
{
   // freopen("cin.txt","r",stdin);
    map<string,int>mat;
    int cnt=0;
    double w;
    string str,str1,str2;
    while(~scanf("%d",&n)&&n)
    {
        //mat.clear();
        for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)
        {
            if(i==j) dist[i][j]=1;
            else dist[i][j]=0;
        }
        for(int i=1;i<=n;i++) cin>>str,mat[str]=i;
        cin>>m;
        while(m--)
        {
            cin>>str1>>w>>str2;
            dist[mat[str1]][mat[str2]]=w;
            //maap[mat[str1]][mat[str2]]=w;
        }
        Floyd();
        printf("Case %d:",++cnt);
        bool flag=false;
        for(int i=1;i<=n;i++)
            if(dist[i][i]>1.0)
            {
                flag=true;
                break;
            }
        if(!flag) printf(" No\n");
        else printf(" Yes\n");
    }
    return 0;
}



全部评论

相关推荐

07-22 11:53
门头沟学院 Java
终于有一个保底的offer了,但感觉是白菜价
北凝a:我想问问,提前批的offer 有问你啥时候到岗吗,如果你还想找其他的怎么办
点赞 评论 收藏
分享
zzzzhz:兄弟你先猛猛投简历至少三百家,能约到面试就去面。最近可以速成智能小车,智慧家居烂大街的项目,不需要自己写,只需要把里面的代码讲解看明白就行。把其中涉及到的八股文都拿出来单独背一下,我去年找工作就一个智能小车智慧家居找了10k差不多。
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务