Arbitrage
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 22293 | Accepted: 9467 |
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
Source
本题大意:套利是利用货币汇率的差异将一个货币单位转换为同一货币的一个以上单位。例如,假设1美元购买0.5英镑,1英镑购买10.0法国法郎,1法国法郎购买0.21美元。然后,通过兑换货币,一个聪明的交易者可以从1美元开始,买入0.5 * 10.0 * 0.21 = 1.05美元,利润为5%。对于输入的国家货币和货币之间的汇率判断是否能够得到套利。
Floyd算法求最短路径,对其进行插入点判断是否路径最短。
利用Floyd算法实现对套利的判断是对Floyd算法的应用。
Floyd算法模板:
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(w[i][k]&&w[k][j])
w[i][j]=1;
}
#include<stdio.h>
#include<string.h>
double w[105][105];
int n;
void floyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(w[i][j]<w[i][k]*w[k][j]) //进行汇率换算,若i对j的汇率小于i对k的汇率乘以k对j的汇率
w[i][j]=w[i][k]*w[k][j]; //更新数组中的值
}
}
int main()
{
int i,j,k,m;
double val;
int flag=0;
int cas=1;
char str[100][50],str1[100],str2[100];
while(~scanf("%d",&n),n)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
w[i][j]=1;
else
w[i][j]=0;
}
}//初始化数组
for(i=1;i<=n;i++)
{
scanf("%s",str[i]);
}
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%s %lf %s",str1,&val,str2);
// printf("%s %lf %s\n",str1,val,str2);
for(j=1;j<=n;j++)
{
if(strcmp(str1,str[j])==0)
break;
}
for(k=1;k<=n;k++)
{
if(strcmp(str2,str[k])==0)
break;
}
w[j][k]=val; //找到输入值所在的位置,对数组中的值进行更新
}
floyd();
flag=0;
for(i=1;i<=n;i++)
{
if(w[i][i] > 1) // 若实现套利 ,数组中对应的值应>1
flag=1;
}
if(flag)
printf("Case %d: Yes\n",cas++);
else
printf("Case %d: No\n",cas++);
}
return 0;
}