poj 2240 Arbitrage 【floyd】
来源:互联网 发布:淘宝怎么看店家vip 编辑:程序博客网 时间:2024/05/16 23:01
Arbitrage
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18817 Accepted: 7964
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.
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.
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
3USDollarBritishPoundFrenchFranc3USDollar 0.5 BritishPoundBritishPound 10.0 FrenchFrancFrenchFranc 0.21 USDollar3USDollarBritishPoundFrenchFranc6USDollar 0.5 BritishPoundUSDollar 4.9 FrenchFrancBritishPound 10.0 FrenchFrancBritishPound 1.99 USDollarFrenchFranc 0.09 BritishPoundFrenchFranc 0.19 USDollar0
Sample Output
Case 1: YesCase 2: No
Source
Ulm Local 1996
#include<stdio.h>#include<string.h>char s[35][200];double dis[35][35];int n;int fin_d(){char s1[200]; scanf("%s",s1); for(int i=1;i<=n;i++) if(strcmp(s1,s[i])==0) return i;}void floyd(){int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(dis[i][j]<dis[i][k]*dis[k][j]) dis[i][j]=dis[i][k]*dis[k][j];}int main(){ int con=1; while(scanf("%d",&n)&&n!=0) {int i,j; for(i=1;i<=n;i++) { scanf("%s",s[i]);// printf("#%s#",s[i]); } for(i=1;i<=n;i++) for(j=1;j<=n;j++) dis[i][j]=1.0;// printf("#"); int m,a,b; double x; scanf("%d",&m); for(i=1;i<=m;i++) { a=fin_d(); scanf("%lf",&x); b=fin_d(); dis[a][b]=x; } floyd(); int bj=0; for(i=1;i<=n;i++) { if(dis[i][i]>1.0) { bj=1; } } if(bj) printf("Case %d: Yes\n",con++); else printf("Case %d: No\n",con++); }}
0 0
- POJ 2240 Arbitrage (Floyd)
- poj 2240Arbitrage(Floyd)
- POJ 2240 Arbitrage Floyd
- POJ 2240 Arbitrage(Floyd)
- POJ 2240 Arbitrage floyd
- poj 2240 Arbitrage 【floyd】
- POJ-2240 Arbitrage(Floyd)
- POJ 2240 Arbitrage(Floyd)
- poj 2240 Arbitrage (Floyd)
- POJ 2240 Arbitrage Floyd || Bellman
- POJ 2240 Arbitrage(Floyd)
- POJ 2240 Arbitrage( floyd)
- POJ -- 2240 Arbitrage (Floyd‘)
- POJ 2240 Arbitrage (Floyd)
- POJ - 2240 Arbitrage(Floyd)
- POJ-2240 Arbitrage(floyd详解)
- zoj 1092 && poj 2240 Arbitrage (floyd算法)
- zoj 1092 || poj 2240 Arbitrage(Floyd)
- Unity 解决 An asset is marked with HideFlags.DontSave but is included in the build 问题。
- 《iOS 9 by Tutorials》 全书翻译导航
- iOS代码混淆-基础篇
- undefined symbol rpl_malloc
- 【ztree系列】右键菜单、节点伸缩
- poj 2240 Arbitrage 【floyd】
- 为众人抱火者, 不可使他冻毙于风雪! 为自由开路者, 不可使他困顿于荆棘
- js 获取打开它的浏览器类型
- 集合类
- springmvc之接收model类
- 分布式和集群的区别
- asp.net MVC5 知识点一
- 树莓派安装和配置kali-linux-2.0
- 使用symbolicatecrash解析crash log日志