最短路
来源:互联网 发布:js 处理json数据 编辑:程序博客网 时间:2024/04/30 18:04
Arbitrage
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 5 Accepted Submission(s) : 4
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
3USDollarBritishPoundFrenchFranc3USDollar 0.5 BritishPoundBritishPound 10.0 FrenchFrancFrenchFranc 0.21 USDollar3USDollarBritishPoundFrenchFranc6USDollar 0.5 BritishPoundUSDollar 4.9 FrenchFrancBritishPound 10.0 FrenchFrancBritishPound 1.99 USDollarFrenchFranc 0.09 BritishPoundFrenchFranc 0.19 USDollar0
Sample Output
Case 1: YesCase 2: No
#include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#define max 1000
using namespace std;
map<string,int>Map;
double d[1010][1010];
int sum;
void init()
{
int i,j;
for(i=1;i<=max;i++)
for(j=1;j<=max;j++)
{
d[i][j]=0;
if(i==j)
d[i][j]=1;
}
}
void Floyed()
{
int k,i,j;
double tem;
for(k=1; k<sum; k++)
for(i=1; i<sum; i++)
for(j=1; j<sum; j++)
{
//代表1个单位的i,能交换d[i][k]个单位的k,而d[i][k]个单位的k能交换tem个j,
//即:1个单位的i,能交换多少个j.
tem=d[i][k]*d[k][j];
if(tem>d[i][j])
{
d[i][j]=tem;
}
}
}
int main()
{
int n,m;
int step=0;
double mo;
string temp;
string a,b;
while(scanf("%d",&n),n)
{
step++;
sum=1;
init();
Map.clear();
for(int i=1; i<=n; i++)
{
cin>>temp;
Map[temp]=sum++;
}
scanf("%d",&m);
for(int i=1; i<=m; i++)
{
cin>>a>>mo>>b;
d[Map[a]][Map[b]]=mo;//代表1个单位a交换mo个单位b;
}
int flag=0;
int t;
Floyed();
for(int i=1; i<sum; i++)
{
if(d[i][i]>1)
{
flag=1;
break;
}
}
if(flag==1)
printf("Case %d: Yes\n",step);
else
printf("Case %d: No\n",step);
}
return 0;
}
#include<algorithm>
#include<map>
#include<cstdio>
#define max 1000
using namespace std;
map<string,int>Map;
double d[1010][1010];
int sum;
void init()
{
int i,j;
for(i=1;i<=max;i++)
for(j=1;j<=max;j++)
{
d[i][j]=0;
if(i==j)
d[i][j]=1;
}
}
void Floyed()
{
int k,i,j;
double tem;
for(k=1; k<sum; k++)
for(i=1; i<sum; i++)
for(j=1; j<sum; j++)
{
//代表1个单位的i,能交换d[i][k]个单位的k,而d[i][k]个单位的k能交换tem个j,
//即:1个单位的i,能交换多少个j.
tem=d[i][k]*d[k][j];
if(tem>d[i][j])
{
d[i][j]=tem;
}
}
}
int main()
{
int n,m;
int step=0;
double mo;
string temp;
string a,b;
while(scanf("%d",&n),n)
{
step++;
sum=1;
init();
Map.clear();
for(int i=1; i<=n; i++)
{
cin>>temp;
Map[temp]=sum++;
}
scanf("%d",&m);
for(int i=1; i<=m; i++)
{
cin>>a>>mo>>b;
d[Map[a]][Map[b]]=mo;//代表1个单位a交换mo个单位b;
}
int flag=0;
int t;
Floyed();
for(int i=1; i<sum; i++)
{
if(d[i][i]>1)
{
flag=1;
break;
}
}
if(flag==1)
printf("Case %d: Yes\n",step);
else
printf("Case %d: No\n",step);
}
return 0;
}
- 最短路 & 次短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- 最短路
- NFC技术扫盲
- requestAnimationFrame
- unix文件类型
- 最短路
- Python笔记——几种数据结构的实现:栈、队列及二叉树
- 最短路
- Python笔记——排序算法的实现
- SQL Server 2005新特性之使用with关键字解决递归父子关系(详细)
- BIOS入口地址:FFFF:0000是指什么意思?在物理上是指内存条的什么位置?
- 最短路
- MFC下CSocket编程详解
- php5总结
- ASP.NET中将对界面的操作封装到DLL中
- SQL连接