zoukankan      html  css  js  c++  java
  • POJ 2240, Arbitrage

    Time Limit: 1000MS  Memory Limit: 65536K
    Total Submissions: 4217  Accepted: 1939


    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

    Source
    Ulm Local 1996


    // POJ2240.cpp : Defines the entry point for the console application.
    //

    #include 
    <iostream>
    #include 
    <string>
    #include 
    <map>
    using namespace std;

    int main(int argc, char* argv[])
    {
        
    int currencies;
        map
    <stringint> ctable;

        
    string name1, name2;
        
    int ins;
        
    double rate;
        
    double d[31][31];
        
    int cases = 1;
        
    while (cin >> currencies && currencies != 0)
        {
            ctable.clear();

            
    for (int i = 0; i < currencies; ++i)
            {
                cin 
    >> name1;
                ctable.insert(make_pair(name1,i));
            }
            
            cin 
    >> ins;

            memset(d, 
    0sizeof(d));
            
    for (int i = 0; i < ins; ++i)
            {
                cin 
    >> name1 >> rate >> name2;
                d[ctable[name1]][ctable[name2]] 
    = rate;
            }

            
    for (int k = 0; k < currencies; ++k)
                
    for (int i = 0; i < currencies; ++i)
                    
    for (int j = 0; j < currencies; ++j)
                        d[i][j] 
    = max(d[i][k] * d[k][j],d[i][j]);

            
    bool possible = false;
            
    for (int i = 0; i < currencies; ++i)
                
    if (d[i][i] > 1)
                {
                    possible 
    = true;
                    
    break;
                };

            
    if (possible == true) cout << "Case "<<cases<<": Yes\n";
            
    else cout << "Case "<<cases<<": No\n";
            
            
    ++cases;
        }
        
    return 0;
    }

  • 相关阅读:
    2017-2018-2 20179205 《网络攻防》第十三周作业 国密算法实现
    2017-2018-2 20179205 《网络攻防技术与实践》第十二周作业 免杀技术
    2017-2018-2 20179205《网络攻防技术与实践》第十一周作业 SQL注入攻击与实践
    2017-2018-2 20179205《网络攻防技术与实践》第十周作业 缓冲区溢出攻防研究
    2017-2018-2 20179205《网络攻防技术与实践》第九周作业
    2017-2018-2 20179205 《网络攻防技术与实践》第八周作业
    2017-2018-2 20179205 《网络攻防技术与实践》第七周作业
    2017-2018-2 20179205《网络攻防技术与实践》Windows攻击实验
    2017-2018-2 20179205 《网络攻防技术与实践》第六周作业
    2017-2018-2 20179205 《网络攻防技术与实践》第五周作业
  • 原文地址:https://www.cnblogs.com/asuran/p/1576837.html
Copyright © 2011-2022 走看看