zoukankan      html  css  js  c++  java
  • Hdoj 1217

    原题链接

    描述

    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.

    输入

    The input file 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.

    输出

    For each test case, print one line telling whether arbitrage is possible or not in the format "Case case: Yes" respectively "Case case: No".

    样例输入

    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

    样例输出

    Case 1: Yes
    Case 2: No

    思路

    floyd算法

    代码

    #include <bits/stdc++.h>
    #define INF 99999999
    #define maxn 1002
    using namespace std;  
    
    double dist[maxn][maxn];
    int length[maxn], f[maxn];
    int n, m;
    map<string, int> mp;
    
    void init()
    {
    	mp.clear();
    //	memset(f, 0, sizeof(f));
    	for(int i = 0; i < maxn; i++)
    		for(int j = 0; j < maxn; j++)
    			dist[i][j] = 0;
    }
    
    int main()
    {
    	int num = 0; 
        while(~scanf("%d", &n) && n)
        {
        	init(); num++;
        	for(int i = 0; i < n; i++)
        	{
        		char c[100]; scanf("%s", c);
        		mp[c] = i;
    		}
    		scanf("%d", &m);
    		for(int i = 0; i < m; i++)
    		{
    			char s1[100], s2[100];
    			double d;
    			scanf("%s %lf %s", s1, &d, s2);
    			if(dist[mp[s1]][mp[s2]] < d) dist[mp[s1]][mp[s2]] = d;
    		}
    		for(int k = 0; k < n; k++)
    			for(int i = 0; i < n; i++)
    				for(int j = 0; j < n; j++)
    					if(dist[i][j] < dist[i][k] * dist[k][j]) 
    						dist[i][j] = dist[i][k] * dist[k][j];
    		int flag = 1;
    		for(int i = 0; i < n; i++)
    			if(dist[i][i] <= 1) flag = 0;
    		printf("Case %d: ", num);
    		if(flag) printf("Yes
    ");
    		else printf("No
    ");
    	}
        return 0;  
    }
    
  • 相关阅读:
    Java调用外部类定义的方法(Static与无Static两种)
    Java调用未被Static修饰的本类方法
    Java调用Static修饰的本类方法
    java利用Aspose.words.jar将本地word文档转化成pdf(完美破解版 无水印 无中文乱码)
    web-程序逻辑问题
    web-忘记密码了
    jenkins部署遇到离线问题如何解决
    Ansible基于playbook批量修改主机名实战
    windows/linux环境python3出现pip is configured with locations that require TLS/SSL, however the..不可用的解决方法
    linux软链接的创建、修改和删除
  • 原文地址:https://www.cnblogs.com/HackHarry/p/8417667.html
Copyright © 2011-2022 走看看