zoukankan      html  css  js  c++  java
  • Arbitrage

     
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 17374   Accepted: 7312

    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
    这题较简单,使用bellman-ford算法就可以了,注意输出,我因为输出WA几次
     1 #include <iostream>
     2 #include<map>
     3 #include<string.h>
     4 using namespace std;
     5 struct edge{
     6     int u,v;
     7     float rate;
     8 } e[40*40];
     9 int cur_num,edge_num;
    10 float dis[40];
    11 map<string,int> mp;
    12 int Bellman_ford(int c){
    13     memset(dis,0,30*sizeof(float));
    14     dis[c]=1.0;
    15     for(int i=0;i<cur_num;i++){
    16         for(int j=0;j<edge_num;j++){
    17             if(dis[e[j].v]<dis[e[j].u]*e[j].rate){
    18                 dis[e[j].v]=dis[e[j].u]*e[j].rate;
    19             }
    20         }
    21     }
    22     if(dis[c]>1.0)
    23         return 1;
    24     else
    25         return 0;
    26 }
    27 int main() {
    28     int count=0;
    29     cin>>cur_num;
    30     while(cur_num){
    31         mp.clear();
    32         for(int i=0;i<cur_num;i++){
    33             string s;
    34             cin>>s;
    35             mp[s]=i;
    36         }
    37         cin>>edge_num;
    38         for(int i=0;i<edge_num;i++){
    39             string s1,s2;
    40             float rate;
    41             cin>>s1>>rate>>s2;
    42             e[i].u=mp[s1];
    43             e[i].v=mp[s2];
    44             e[i].rate=rate;
    45         }
    46         int flag=0;
    47         for(int i=0;i<cur_num;i++){
    48             flag=Bellman_ford(i);
    49             if(flag)
    50                 break;
    51         }
    52 
    53         if(flag)
    54             cout<<"Case "<<++count<<": Yes"<<endl;
    55         else
    56             cout<<"Case "<<++count<<": No"<<endl;
    57         cin>>cur_num;
    58     }
    59     return 0;
    60 }
  • 相关阅读:
    css之隐藏内容的方法
    字符串对象的各种方法
    javascript之自增自减典型运算(易错)
    Fuel 30 分钟快速安装OpenStack
    使用Sublime Text 3做Python开发
    Ubuntu 14.04.02 安装openvswitch-2.3.1
    linux 技巧:使用 screen 管理你的远程会话
    MQTT的学习研究(十七)Mosquitto简要教程(安装&使用)
    MQTT的学习研究(十六) MQTT的Mosquitto的window安装部署
    MQTT的学习研究(十五) MQTT 和android整合文章
  • 原文地址:https://www.cnblogs.com/sdxk/p/4638196.html
Copyright © 2011-2022 走看看