poj 2240 Arbitrage(最短路+Bellman-Ford)

Arbitrage

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. 

Input

The input will contain one or more test cases. Om the first line of each test case there is an integer n (1 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

Ulm Local 1996

思路：只要是经过许多边能让其值大于1，就说明可以套汇，因此可以使用类似于最短路的算法，求最大汇率，bellman-ford.每次往大的松弛的。

#include
#include
using namespace std;
const int mm=990;
const double oo=1e9;
class node
{
  public:int u,v;double c;
}edge[mm];
char s[33][110],a[mm],b[mm];
double dis[mm];
int n,m,pos;
bool bell_man(int v)
{
  memset(dis,0,sizeof(dis));
  dis[v]=1;
  for(int i=0;i1.0)return 1;
  else return 0;
}
int main()
{ int cas=0;
  while(cin>>n&&n)
  { pos=0;++cas;
    for(int i=0;i>s[i];
    cin>>m;double d;
    for(int i=0;i>a>>d>>b;
      int j=-1;
      while(strcmp(s[++j],a)!=0);edge[pos].u=j;j=-1;
      while(strcmp(s[++j],b)!=0);edge[pos].v=j;
      edge[pos++].c=d;
    }
    bool flag=0;
    for(int i=0;i

服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.fwqtg.net

相关推荐: polygon.js—多边形52

//建立这样一个对象，每次绘制时可以加入到一个缓存中，以后可以实现拖动等操作 var Point = function (x, y) { this.x = x; this.y = y; }; var Polygon = function (centerX, c…