poj2240Arbitrage【floyd】
来源:互联网 发布:天刀捏脸数据存多个 编辑:程序博客网 时间:2024/05/23 13:21
Language:
Arbitrage
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18622 Accepted: 7860
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
题意:求一个环环内乘积大于1即可
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#define inf 0x3f3f3f3fusing namespace std;char s[2][110];char str[35][110];double map[35][35];void floyd(int n){for(int k=1;k<=n;++k){for(int i=1;i<=n;++i){for(int j=1;j<=n;++j){map[i][j]=max(map[i][j],map[i][k]*map[k][j]);}}}}int main(){int n,i,j,m,k=1;double rate;while(scanf("%d",&n),n){for(i=1;i<=n;++i){scanf("%s",str[i]);}for(i=1;i<=n;++i){for(j=1;j<=n;++j){map[i][j]=0;}}scanf("%d",&m);int a,b;for(i=0;i<m;++i){scanf("%s%lf%s",s[0],&rate,s[1]);for(j=1;j<=n;++j){if(strcmp(str[j],s[0])==0){a=j;}if(strcmp(str[j],s[1])==0){b=j;}}map[a][b]=rate;}floyd(n);double ans=0;for(i=1;i<=n;++i){if(map[i][i]>1)break;}if(i>n){printf("Case %d: No\n",k++);}else printf("Case %d: Yes\n",k++);}return 0;}
0 0
- poj2240Arbitrage【floyd】
- poj2240Arbitrage(最短路floyd)
- POJ2240Arbitrage
- POJ2240Arbitrage SPFA+邻接矩阵
- 杭电1217&&poj2240Arbitrage
- poj2240Arbitrage(最短路 弗洛伊德)
- poj2240Arbitrage (Bellman-ford求正环+map)
- floyd
- Floyd
- Floyd
- floyd
- floyd
- floyd
- Floyd
- FLOYD
- Floyd
- Floyd
- Floyd算法
- Java的三种注释 Javadoc标记*
- 编译原理实验一:为PL/0语言编写一个词法分析程序
- java基本知识(一)
- Problems with JSPDF and AutoTable
- java中的内部类总结
- poj2240Arbitrage【floyd】
- Java 如何有效地避免OOM:善于利用软引用和弱引用
- ubuntu 14.04 终端 打开文件编辑 i使用不了 不能插入了
- Python小知识备忘录
- SSH返回Json格式的数据
- 最优合并问题
- Google Protocol Buffer 的使用和原理
- UiObject2介绍
- 如何定义和实现一个类的成员函数为回调函数