Floyd: Arbitrage
来源:互联网 发布:扫描字的软件 编辑:程序博客网 时间:2024/05/17 23:35
F - Arbitrage
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
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
汇率兑换,用map把地名转换成点,再直接弗洛伊德即可
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <map>using namespace std;map<string, int>mm;double d[40][40];int main(){ int i, j, k; int n, m; int flag; char tmp[100]; double w; int cnt = 0; while(scanf("%d", &n) && n){ for(i = 1; i <= n; i ++){ scanf("%s", tmp); string str = tmp; mm[str] = i; } for(i = 1; i <= n; i ++) for(j = 1; j <= n; j ++){ d[i][j] = -1; if(i == j) d[i][j] = 1; } scanf("%d", &m); for(i = 1; i <= m; i ++){ scanf("%s", tmp); string str = tmp; int a = mm[str]; scanf("%lf", &w); scanf("%s", tmp); str = tmp; int b = mm[str]; d[a][b] = w; } for(k = 1; k <= n; k ++) for(i = 1; i <= n; i ++) for(j = 1; j <= n; j ++){ if(d[i][k] != -1 && d[k][j] != -1){ if(d[i][k] * d[k][j] > d[i][j]) d[i][j] = d[i][k] * d[k][j]; } } flag = 0; for(i = 1; i <= n; i ++){ if(d[i][i] > 1.0){ flag = 1; break; } } cnt ++; if(flag) printf("Case %d: Yes\n", cnt); else printf("Case %d: No\n", cnt); } return 0;}
- Floyd: Arbitrage
- pku 2240 Arbitrage(floyd)
- POJ 2240 Arbitrage (Floyd)
- hdu 1217 Arbitrage--Floyd
- poj 2240Arbitrage(Floyd)
- POJ 2240 Arbitrage Floyd
- 【hdu 】 Arbitrage (Floyd)
- Arbitrage hdu1217 Floyd算法
- Arbitrage+floyd算法
- hdu1217 Arbitrage (Floyd)
- POJ 2240 Arbitrage(Floyd)
- poj2240 Arbitrage(floyd)
- HDU1217 Arbitrage Floyd算法
- POJ2240 Arbitrage (Floyd
- hdu 1217 Arbitrage 【floyd】
- hdu 1217Arbitrage floyd
- hdu 1217 Arbitrage (Floyd)
- POJ 2240 Arbitrage floyd
- cocos2d实现了以下CCEaseAction类
- HTTPCookie 的使用和讲解
- JVM内存溢出分析
- ZOJ Monthly, July 2012浙大月赛解题报告
- Android动态加载jar/dex
- Floyd: Arbitrage
- Windows Phone 开发学习笔记(九) RSS阅读器之获取数据
- android的测试工具CTS
- C语言插件机制(上)
- isight5 二次开发之 Application (2) 之 Calc组件
- 面试体会
- <cf> Prizes, Prizes, more Prizes
- C语言插件机制(下)
- 对于排序 学习心得