Arbitrage

最新推荐文章于 2019-03-29 02:08:35 发布

敢于挑战才会成功

最新推荐文章于 2019-03-29 02:08:35 发布

阅读量412

点赞数

分类专栏：图论文章标签： ACM_nyoj c++ 算法

本文链接：https://blog.csdn.net/wangxianse/article/details/51135917

版权

图论专栏收录该内容

14 篇文章 0 订阅

订阅专栏

算法：floyd；

描述

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 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.
输出
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
来源
NKOJ or 1996/97 Ulm Internal Contest
上传者
苗栋栋

代码：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <iomanip>
#include <map>
using namespace std;
map<string,int>floy;
double dis[40][40];
int main()
{
	int i,j,m,n,k,q=1;
	string st,s,t;
	double p;
	while(cin>>n&&n)
	{
		memset(dis,0,sizeof(dis));
		for(i=1;i<=n;i++)
		{
			cin>>st;
			floy[st]=i;
			dis[i][i]=1;
		}
		cin>>m;
		for(i=1;i<=m;i++)
		{
			cin>>s>>p>>t;
			dis[floy[s]][floy[t]]=max(dis[floy[s]][floy[t]],p);
		}
		int ok=0;
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			for(k=1;k<=n;k++)
			if(dis[j][k]<dis[j][i]*dis[i][k])
			{
				dis[j][k]=dis[j][i]*dis[i][k];
				if(j==k&&dis[j][k]>1) ok=1;
			}
		}
		cout<<"Case "<<q++<<": ";
		if(ok) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}