zoukankan      html  css  js  c++  java
  • poj2240最短路 floyd

    Arbitrage
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 17360   Accepted: 7308

    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<=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



      • Source Code
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    char str[40][40],str2[40],str1[40];
    double book[40][40];
    int main(){
        int t;
        int count=0;
        while(scanf("%d",&t)!=EOF){
            if(t==0)
            break;
            memset(str,0,sizeof(str));
            count++;
    
            memset(book,0,sizeof(book));
            getchar();
            for(int i=0;i<t;i++){
            scanf("%s",str[i]);
            book[i][i]=1.0;
            getchar();
            }
            int n;
            scanf("%d",&n);
            double d;
            for(int i=0;i<n;i++){
                memset(str1,0,sizeof(str1));
                memset(str2,0,sizeof(str2));
               scanf("%s %lf %s",str1,&d,str2);
               int temp1,temp2;
               for(int ii=0;ii<t;ii++){
                  if(strcmp(str1,str[ii])==0)
                  temp1=ii;
               }
               for(int ii=0;ii<t;ii++){
                 if(strcmp(str2,str[ii])==0)
                 temp2=ii;
               }
               book[temp1][temp2]=d;
               getchar();
            }
    
            for(int k=0;k<t;k++){
              for(int i=0;i<t;i++){
                 for(int j=0;j<t;j++){
                   if(book[i][j]<book[i][k]*book[k][j])
                   book[i][j]=book[i][k]*book[k][j];
                 }
              }
            }
    
            int flag=0;
            for(int i=0;i<t;i++){
                if(book[i][i]>1.0)
                flag=1;
            }
            if(flag==1)
            printf("Case %d: Yes
    ",count);
            else
            printf("Case %d: No
    ",count);
    
    
        }
        return 0;
    }









  • 相关阅读:
    集合类小结
    Java相关文章
    centos下同时启动多个tomcat
    express发送get或post请求
    node.js的querystring模块
    node.js的url解析和生成
    node.js判断是否文件夹和文件
    node.js删除文件
    node.js对文件夹增删改查的操作
    node运行js文件热更新
  • 原文地址:https://www.cnblogs.com/13224ACMer/p/4621137.html
Copyright © 2011-2022 走看看