poj2240 Arbitrage(bellman)
来源:互联网 发布:淘宝多少转化率正常 编辑:程序博客网 时间:2024/05/21 00:53
Arbitrage
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16371 Accepted: 6877
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
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
Source
Ulm Local 1996
/*把字符串处理了之后跟前边的一道题一样bellman 判正环Time:2015-1-5 20:30*/#include<cstdio>#include<cstring>#include<string>#include<iostream>#include<algorithm>#include<queue>#include<map>using namespace std;const int MAX=1000;#define eps 1e-8map<string,int>mp;struct Node{ int u,v; double r;}p[MAX];double dis[MAX];int n,num;bool bellman_ford(){ int s=1; for(int i=1;i<=n;i++) dis[i]=0.00; double v=100.00; dis[s]=v; while(dis[s]<=v){ bool flag=false; for(int i=0;i<num;i++){ // printf("u=%d v=%d i=%lf\n",p[i].u,p[i].v,p[i].r); double temp=dis[p[i].u]*p[i].r; //printf("%lf %lf\n",temp,dis[p[i].v]); if(dis[p[i].v]<temp){ dis[p[i].v]=temp; //printf("%lf\n",temp); flag=true; } } // printf("%lf\n",dis[s]); if(!flag)return dis[s]>v; } return true;}int main(){ string curr; int m;int nCase=0; while(scanf("%d",&n)!=EOF){ if(n==0) break; mp.clear(); for(int i=1;i<=n;i++){ cin>>curr; mp[curr]=i; } scanf("%d",&m); string A,B; double rate; num=0; for(int i=1;i<=m;i++){ cin>>A>>rate>>B; p[num].u=mp[A]; p[num].v=mp[B]; p[num++].r=rate; // p[num].v=mp[A]; p[num].u=mp[B]; p[num++].r=1.0/rate; } printf("Case %d: ",++nCase); if(bellman_ford())puts("Yes"); else puts("No"); }return 0;}
0 0
- POJ2240《Arbitrage》方法:bellman
- poj2240 Arbitrage(bellman)
- poj2240&zoj1092 Arbitrage(Bellman-Ford)
- poj2240——Arbitrage(Bellman-Ford算法)
- POJ2240:Arbitrage
- poj2240 Arbitrage
- poj2240 - Arbitrage
- POJ2240 Arbitrage
- Arbitrage poj2240
- POJ2240 Arbitrage
- poj2240 Arbitrage
- poj2240--Arbitrage
- poj2240 Arbitrage
- POJ2240 - Arbitrage
- POJ2240-Arbitrage
- poj2240 Arbitrage
- POJ2240 Arbitrage
- poj2240 Arbitrage
- 编译Android出错:Unable to execute dex: Java heap space
- [端口扫描]S扫描器跨网段扫描
- A+B Problem
- 2015年1月5日
- Hibernate——ORMapping
- poj2240 Arbitrage(bellman)
- 设计模式速记
- 2015书单
- spring aop
- 链表插入删除操作
- Failed to create the java Visual Machine
- 线程同步
- 华为机试—相同子串
- mpu6050 研究