Arbitrage
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8625 Accepted Submission(s): 3977
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
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
Source
//hdu 1217
//#include"stdafx.h"
#include<iostream>
#define size 110
#define INF 1<<20
using namespace std;
double map[size][size];
char name[40][20];
int n, edge;
//图的下标从1开始
void Floyd() {
int i, j, k;
for (k = 1; k <= n; k++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
/*关键:意思是找到从i到j汇率最大的值
比如:找到1到3汇率最大值 再找到3到1汇率最大值之后
如果1到3的最大汇率乘以3到1的最大汇率值超过1表明存
在Arbitrage现象
*/
if (map[i][k] * map[k][j] > map[i][j]) {
map[i][j] = map[i][k] * map[k][j];
}
}
}
}
int main() {
//输入顶点数n边数edge
int cases = 1;
while (cin >> n&&n) {
//图的初始化 该题只需要全部置为0
memset(map, 0, sizeof(map));
memset(name, 0, sizeof(name));
for (int i = 1; i <= n; i++)
cin >> name[i];
cin >> edge;
for (int i = 0; i < edge; i++) {
char startpos[20], endpos[20];
int startpoint, endpoint;
double value;
cin >> startpos >> value >> endpos;
for (int j = 1; j <= n; j++) {
if (strcmp(startpos, name[j]) == 0) {
startpoint = j;
}
if (strcmp(endpos, name[j]) == 0) {
endpoint = j;
}
}
map[startpoint][endpoint] = value;
}
Floyd();
bool flag = false;
//查找是否存在端点的值大于1 存在输出yes不存在输出no
for (int i = 1; i <= n; i++) {
if (map[i][i] > 1) {
flag = true;
break;
}
}
cout << "Case " << cases << ": ";
if (flag) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
cases++;
}
}