zoukankan      html  css  js  c++  java
  • POJ 2240Arbitrage(Floyd)

    E - Arbitrage
    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
    Appoint description: 

    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
    

    Sample Output

    Case 1: Yes
    Case 2: No
    

     先输入货币的种类,然后接着是每个货币的兑换关系,问是否有一种货币能增值,也就是通过某种兑换关系是g[i][i] >1

    初始化傻逼地将g设成了INF,白白贡献了4次WA

     1 #include <iostream>
     2 #include <cstring>
     3 #include <algorithm>
     4 #include <cstdio>
     5 #include <map>
     6 using namespace std;
     7 const int MAX = 50;
     8 const int INF = 1 << 15;
     9 int n;
    10 double g[MAX][MAX];
    11 map<string,int> m;
    12 void Floyd()
    13 {
    14     for(int k = 1; k <= n; k++)
    15     {
    16         for(int i = 1; i <= n; i++)
    17         {
    18             for(int j = 1; j <= n; j++)
    19             {
    20                 if(g[i][k] != 0 && g[k][j] != 0 && g[i][j] < g[i][k]*g[k][j])
    21                 {
    22                     g[i][j] = g[i][k]*g[k][j];
    23                 }
    24             }
    25         }
    26     }
    27 }
    28 int main()
    29 {
    30     int num = 0;
    31     while(scanf("%d", &n) != EOF && n)
    32     {
    33         int t;
    34         char temp[100],str[100];
    35         double rat;
    36         m.clear();
    37         for(int i = 1; i <= n; i++)
    38         {
    39             for(int j = 1; j <= n; j++)
    40                 g[i][j] = 0;
    41         }
    42         for(int i = 1; i <= n; i++)
    43         {
    44             scanf("%s", temp);
    45             m[temp] = i;
    46         }
    47         scanf("%d", &t);
    48         for(int i = 1; i <= t; i++)
    49         {
    50             scanf("%s%lf%s",temp,&rat,str);
    51             g[ m[temp] ][ m[str] ] = rat;
    52         }
    53         Floyd();
    54         int flag = 0;
    55         for(int i = 1; i <= n; i++)
    56         {
    57             if(g[i][i] != 0 && g[i][i] > 1.0)
    58             {
    59                 flag = 1;
    60                 break;
    61             }
    62         }
    63         printf("Case %d: ",++num);
    64         if(flag)
    65             printf("Yes
    ");
    66         else
    67             printf("No
    ");
    68     }
    69     return 0;
    70 }
    View Code
     
  • 相关阅读:
    前端百度地图开发使用总结
    换电脑后如何同步git本地仓库及分支
    vue mint-ui初次使用总结
    git学习入门总结
    深夜,当音乐响起,数据在MySQL中静静的疯狂计算
    且说Tomcat、Servlet、JSP和Spring
    国庆与中秋7天死磕Web的时光
    Android编程初涉,以控制摄像头为例
    谈现阶段如何形成可行的健康生活习惯方案
    说Java网络编程
  • 原文地址:https://www.cnblogs.com/zhaopAC/p/4998081.html
Copyright © 2011-2022 走看看