英语题翻译30

Arbitrage | JXNUOJ

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.

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.

For each test case, print one line telling whether arbitrage is possible or not in the format "Case case: Yes" respectively "Case case: No".

翻译：

套利是利用货币汇率的差异将一个单位的货币转换为多个单位的同种货币。例如，假设 1 美元买 0.5 英镑，1 英镑买 10.0 法国法郎，1 法国法郎买 0.21 美元。然后，通过兑换货币，聪明的交易者可以从 1 美元开始，买入 0.5 * 10.0 * 0.21 = 1.05 美元，获利 5%。你的工作是编写一个程序，将货币汇率列表作为输入，然后确定是否可以套利。

输入文件将包含一个或多个测试用例。 Om 每个测试用例的第一行有一个整数 n (1<=n<=30)，表示不同货币的数量。接下来的 n 行每行包含一种货币的名称。在名称中不会出现空格。下一行包含一个整数 m，表示要跟随的表格的长度。最后 m 行每行包含源货币的名称 ci、表示从 ci 到 cj 的汇率的实数 rij 和目标货币的名称 cj。没有出现在表格中的交换是不可能的。测试用例之间用空行分隔。输入以 n 的值为零 (0) 终止。

对每个测试用例，以“Case case: Yes”和“Case case: No”的格式打印一行说明是否可以套利。