POJ 2240 Arbitrage floyd
2015-08-21 16:35
295 查看
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
这个题要理解好题意T^T反正我是第一遍没想到求[i][i]>1.0即可 注意与下一篇的比较
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
这个题要理解好题意T^T反正我是第一遍没想到求[i][i]>1.0即可 注意与下一篇的比较
#include <iostream> #include <cstdio> #include<map> #include <string.h> using namespace std; map<string,int>mat; double dist[100][100]; int n,m; void Floyd() { for(int k=1;k<=n;k++) for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { if(dist[i][k]*dist[k][j]>dist[i][j]) { dist[i][j]=dist[i][k]*dist[k][j]; // pre[i][j]=k; } } } } int main() { // freopen("cin.txt","r",stdin); map<string,int>mat; int cnt=0; double w; string str,str1,str2; while(~scanf("%d",&n)&&n) { //mat.clear(); for(int i=1;i<=n;i++)for(int j=1;j<=n;j++) { if(i==j) dist[i][j]=1; else dist[i][j]=0; } for(int i=1;i<=n;i++) cin>>str,mat[str]=i; cin>>m; while(m--) { cin>>str1>>w>>str2; dist[mat[str1]][mat[str2]]=w; //maap[mat[str1]][mat[str2]]=w; } Floyd(); printf("Case %d:",++cnt); bool flag=false; for(int i=1;i<=n;i++) if(dist[i][i]>1.0) { flag=true; break; } if(!flag) printf(" No\n"); else printf(" Yes\n"); } return 0; }
相关文章推荐
- 数组常用的方法
- jquery :checked(过滤选择器) 和 空格:checked(后代选择器)
- hadoop 2.X 命令文件目录的变化
- Android基础入门教程——2.3.10 ScrollView(滚动条)
- java面试
- 编写高质量代码(1)
- JAVA学习篇--静态代理VS动态代理
- 【网络编程】之七、select聊天室
- 【网络编程】之六、选择select
- myeclipse调式与属性显示
- oci学习
- 【LeetCode】36. Valid Sudoku
- .
- 字符串和字符String and Characters
- Effective C++学习笔记五(实现)
- DrawerLayout + Toolbar + ViewPager
- break label 用法
- 解决android中Layout文件下的xml文件配好后,R类中不能自动生成相应代码
- IOS-笔记11(StoryBoard自动布局)
- 【网络编程】之五、异步模型