Arbitrage
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11614 | Accepted: 4874 |
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
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
分析:题意是能否赚汇率差,比如 有三种货币 A B C如果1 A能通过汇率的兑换到最后能大于 1 A。那么就输出yes否则no
这题如过用bfs时间会是30的30次方行不通,用dfs如果处理不好会进入死循环,这题我们可以理解为要找到一个兑换路线,使A通过其他货币获得利润兑换更多的A。我们吧汇率看成边的权值,这就是最短路径的变种求最大路径。
#include <iostream> #include <map> #include <string> using namespace std; double mg[40][40]; int n; bool floyd() { int i, j, k; for (k = 0; k< n; k++) { for (i = 0; i< n; i++) { for (j = 0; j< n; j++) { if (mg[i][j] < mg[i][k]*mg[k][j]) { mg[i][j] = mg[i][k]*mg[k][j]; } } } } for (i = 0; i< n; i++) { if (mg[i][i] > 1.0) { return true; } } return false; } int main() { int m, i, j, icount = 0; double values; string s1, s2; map<string, int> a; while (cin >> n && n!=0) { a.clear(); for (i = 0; i < n; i++) { for (j = 0; j< n; j++) { mg[i][j] = i==j?1:0; } cin >> s1; a[s1] = i; } cin >> m; for (i = 0; i< m; i++) { cin >> s1 >> values >> s2; mg[a[s1]][a[s2]] = values; } cout<<"Case "<<++icount<<": "; if(floyd()) { cout<<"Yes"<<endl; } else { cout<<"No"<<endl; } } return 0; }