floyd 变形
来源:互联网 发布:关于淘宝的故事 编辑:程序博客网 时间:2024/04/29 03:26
Arbitrage
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 48 Accepted Submission(s) : 21
Problem 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 file 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#include <iostream>#include <cstdio>#include <cstring>#include <string>using namespace std;double data[40][40];int n , m ;int cases = 1;void init(){ for(int i = 0; i < 40; i ++) for(int j = 0; j < 40; j ++){ if(i == j) data[i][j] = 1; else data[i][j] = 0; }}int find_xy(char a[][40], char* s){ for(int i = 0; i < n; i ++) { if(strcmp(a[i] , s) == 0){ return i; } } return -1;}void floyd(){ for(int k = 0; k < n; k ++) for(int i = 0; i < n; i ++) for(int j = 0; j < n; j ++) if(data[i][j] < data[i][k] * data[k][j]) data[i][j] = data[i][k] * data[k][j];}void output(){ for(int i = 0; i < n; i ++) if(data[i][i] > 1){ printf("Case %d: Yes\n",cases++); return ; } printf("Case %d: No\n",cases++);}int main(){ char a[40][40]; char s[40]; char e[40]; double c; int x , y; while(scanf("%d",&n),n) { init(); for(int i = 0; i < n; i ++){ scanf("%s",a[i]); } scanf("%d",&m); for(int i = 0; i < m; i ++) { scanf("%s %lf %s",s,&c,e); x = find_xy(a , s); y = find_xy(a , e); if(x == -1 || y == -1) continue; data[x][y] = c; } floyd(); output(); } return 0;}
0 0
- floyd 变形
- floyd 变形或Dijkstra 变形
- POJ 2253 floyd()变形
- 10048 - Audiophobia (floyd变形)
- poj 3615(floyd变形)
- poj2263&poj2570 floyd变形
- poj2253 floyd变形
- poj2253 变形Floyd
- poj2240 变形floyd算法
- hdu 1217(Floyd变形)
- zzuoj 10400 floyd变形
- hdu 3631(Floyd变形)
- poj 3615(Floyd变形)
- poj 2253 floyd变形
- ACM floyd变形 Frogger
- Frogger(Floyd变形)
- Frogger(poj2253)-floyd变形
- ZOJ 1092 Arbitrage (floyd变形)
- struts2结合过滤器和cookie实现自动登录
- 用Qt写一个截屏工具
- 我的vim设置
- CloudTest Getting Started Guide
- poj 1131 Octal Fractions
- floyd 变形
- Android初试--更新进度条(ProgressBar)2
- php 前一天或后一天的日期
- Android API Guides 之 App Components(3) - Activities
- Lucene的各种查询
- 进程通信实例之父子进程通信
- NSString字符串截取三种方法
- C++各种智能指针的用法及区别
- ubuntu软件安装/卸载/升级/基本命令笔记