poj2240Arbitrage【floyd】
2015-11-22 20:41
453 查看
Language: Default Arbitrage
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. 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. 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 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define inf 0x3f3f3f3f
using namespace std;
char s[2][110];
char str[35][110];
double map[35][35];
void floyd(int n){
for(int k=1;k<=n;++k){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
map[i][j]=max(map[i][j],map[i][k]*map[k][j]);
}
}
}
}
int main()
{
int n,i,j,m,k=1;
double rate;
while(scanf("%d",&n),n){
for(i=1;i<=n;++i){
scanf("%s",str[i]);
}
for(i=1;i<=n;++i){
for(j=1;j<=n;++j){
map[i][j]=0;
}
}
scanf("%d",&m);
int a,b;
for(i=0;i<m;++i){
scanf("%s%lf%s",s[0],&rate,s[1]);
for(j=1;j<=n;++j){
if(strcmp(str[j],s[0])==0){
a=j;
}
if(strcmp(str[j],s[1])==0){
b=j;
}
}
map[a][b]=rate;
}
floyd(n);
double ans=0;
for(i=1;i<=n;++i){
if(map[i][i]>1)break;
}
if(i>n){
printf("Case %d: No\n",k++);
}
else printf("Case %d: Yes\n",k++);
}
return 0;
}
相关文章推荐
- 初识Winsock之美
- CSS基础学习十六:CSS盒子模型补充之border-radius属性
- Java 如何有效地避免OOM:善于利用软引用和弱引用
- linux上文件格式引起的问题
- Problems with JSPDF and AutoTable
- 三个兼容性问题 ,以及解决方案
- 从上往下打印二叉树
- SQL Server之连接
- java基本知识(一)
- java中的内部类总结
- Error when launching Quest Central for DB2: "QCC10000E - Unable to allocate environment handle fo
- SQL server 连接查询
- Java的三种注释 Javadoc标记*
- 控制反转和依赖注入原理
- iOS的二维码扫描
- Android-Material Design布局之第一曲
- 流形学习入门篇1
- 三大Javaweb框架的工作原理--Struts2+Hibernate+Spring3
- Android4.4实现状态栏沉浸
- vivado抓FPGA上debug singal波形的方法