POJ2240 Arbitrage 最短路 bellmanford
2015-09-24 20:33
232 查看
Arbitrage
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
Sample Output
告诉一些货币之间兑换的汇率,问是否存在某种兑换方式,使得钱越变越多
我们假设最开始有1单位货币,枚举以每个类型货币为起点,尝试兑换,这个问题可以转化为求是否存在连续乘积大于1的回路,可以直接用bellmanford求解问题
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 18275 | Accepted: 7738 |
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
告诉一些货币之间兑换的汇率,问是否存在某种兑换方式,使得钱越变越多
我们假设最开始有1单位货币,枚举以每个类型货币为起点,尝试兑换,这个问题可以转化为求是否存在连续乘积大于1的回路,可以直接用bellmanford求解问题
#include <iostream> #include <stdio.h> #include <string> #include <cstring> #include <algorithm> #include <cmath> #include <queue> using namespace std; char name[222][222]; char b[222],a[222]; int n; int m; double x; int flag; double dis[2222]; struct Node { int u,v; double w; }f[2222]; void bellmanford(int x) { memset(dis,0,sizeof dis); dis[x]=1.0; for(int i=1;i<=n;i++)//操作n次 { for(int j=1;j<=m;j++) { dis[f[j].v]=max(dis[f[j].v],dis[f[j].u]*f[j].w); } } if(dis[x]>1.0) flag=1; } int main() { int ca=1; while(scanf("%d",&n),n) { for(int i=1;i<=n;i++) scanf("%s",name[i]); scanf("%d",&m); for(int i=1;i<=m;i++) { scanf("%s %lf %s",a,&x,b); int j,k; for(j=1; strcmp(a,name[j]); j++) ; for(k=1; strcmp(b,name[k]); k++) ; f[i].u=j; f[i].v=k; f[i].w=x; } flag=0; for(int i=1;i<=n;i++) { bellmanford(i); if(flag) break; } printf("Case %d: ",ca++); if(flag) puts("Yes"); else puts("No"); } return 0; }
相关文章推荐
- C++实现屏幕截图(全屏截图)
- c++连接SQL server2005
- 设计模式之观察者模式---Observer Pattern
- android外存文件读写
- R文件丢失最正确的解决方案
- php判断数组元素中是否存在某个字符串的方法
- 杭电2680-Choose the best route(最短路反向建图)
- 3、下载与安装Eclipse
- 多态的理解
- Web Service那些事 1/4
- IBM软件集团大中华区总架构师寇卫东:话说程序员的职业生涯-IT程序人生-职业生涯规划
- android studio 快捷键(mac)
- 如何制作一个漂亮的 Android 应用图标
- 泛型
- hdu 5438 Ponds 2015 ACM/ICPC Asia Regional Changchun Online
- Nginx 负载均衡配置和策略
- Majority Element
- C++ 3维数组指针声明的3种方式
- cdoj 92 Journey tarjan/lca 树上点对距离
- POJ - 2194