1217 Arbitrage(最短路)
来源:互联网 发布:java 深拷贝工具类 编辑:程序博客网 时间:2024/04/30 00:45
Arbitrage
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
最短路题,因为只有30组,可以直接用floyd水过去
附上AC代码:
#include<bits/stdc++.h>using namespace std;const int INF=0x3f3f3f3f;/*struct Edge { string from,to; int dist;};vector<Edge>edge;*/string money[32];vector<float>d[32];void init(){ /*edge.resize(1005); edge.clear();*/ for(int i=1;i<31;i++) { d[i].resize(32); for(int j=1;j<31;j++) d[i][j]=0; }}int n;int find(string s) { for(int i=1;i<=n;i++) { if(money[i]==s) { return i; } }}void floyd(){ for(int k=1;k<=n;k++){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++) { float t=d[i][k]*d[k][j]; if(t>d[i][j]) d[i][j]=t; if(i==j&&d[i][j]>1) { cout<<"Yes"<<endl; return; } } } } cout<<"No"<<endl; return ;}int main(){ int m,k=1; while(cin>>n&&n) { init(); for(int i=1;i<=n;i++) cin>>money[i]; cin>>m; for(int i=1;i<=m;i++) /*cin>>edge[i].from>>edge[i].dist>>edge[i].to;*/ { string a,b; float c; cin>>a>>c>>b; d[find(a)][find(b)]=c; } cout<<"Case "<<k<<": "; k++; floyd(); } return 0;}
- 1217 Arbitrage(最短路)
- HDU 1217Arbitrage(FLODY最短路)
- hdu 1217 Arbitrage(最短路)
- HDOJ 1217 Arbitrage (最短路 Floyd)
- Arbitrage(hdu 1217 最短路)
- POJ2240 Arbitrage(最短路)
- hdu 1217 Arbitrage(Floyd最短路算法+map应用)
- 文章标题 HDU 1217 : Arbitrage(最短路--Floyd+map)
- HDU 1217 Arbitrage(最短路判断负环)
- HDU 1217 Arbitrage 乘法最短路
- hdu 1217 && poj2240 Arbitrage 最短路
- HDOJ-1217Arbitrage(FLOYD最短路)
- HDU 1217 Arbitrage 【最短路,map+spfa】
- zoj 1092 Arbitrage(最短路,floyd)
- POJ 2240 Arbitrage(最短路 Floyd)
- zoj 1092 Arbitrage(最短路)
- POJ 2240 Arbitrage(最短路)
- POJ 2240Arbitrage(最短路floyd)
- Visual Studio2010(vs2010)的快捷方式图标
- 聚簇索引概念(Myisam与Innodb索引的区别)
- 关于盒须图的那些事——四分位数,插值法
- 学期项目之HTML5重要理解点小结
- filter与servlet的区别
- 1217 Arbitrage(最短路)
- 用gitosis搭建git服务器
- vertical-align和text-align
- centos+mysql安装步骤
- HashMap实现
- 从web.xml学xml
- Java设计模式笔记之中介者模式
- 淘淘商城系列——nginx实现负载均衡
- 51Nod--1014 X^2 Mod P