hdu 1217 Arbitrage
来源:互联网 发布:科密x1考勤机导出数据 编辑:程序博客网 时间:2024/06/07 04:16
Arbitrage
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8579 Accepted Submission(s): 3956
Problem 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.
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 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.
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
3USDollarBritishPoundFrenchFranc3USDollar 0.5 BritishPoundBritishPound 10.0 FrenchFrancFrenchFranc 0.21 USDollar3USDollarBritishPoundFrenchFranc6USDollar 0.5 BritishPoundUSDollar 4.9 FrenchFrancBritishPound 10.0 FrenchFrancBritishPound 1.99 USDollarFrenchFranc 0.09 BritishPoundFrenchFranc 0.19 USDollar0
Sample Output
Case 1: YesCase 2: No预备知识:stl中的map<string,int>xxx(表示建立一个以字符串为下标,以十进制整数为值的图)方法:根据回了建立一张图,根据题目找出最大环(权值相乘),若权值大于1就可以有收益#include<iostream>#include<cstdio>#include<map>#include<cstring>using namespace std;double mp1[100][100];int main(int argc, char *argv[]){int i,n,j;int a[10000];char b[100];char c[100];map<string,int>mymap;int flag1=1;while(scanf("%d",&n),n){for(i=0;i<n;i++){scanf("%s",b);mymap[b]=i;}for(i=0;i<n;i++){for(j=0;j<n;j++){mp1[i][j]=0;}}int m;double h;scanf("%d",&m);getchar();for(i=0;i<m;i++){scanf("%s %lf %s",b,&h,c);mp1[mymap[b]][mymap[c]]=h;}int k;for(k=0;k<n;k++){for(i=0;i<n;i++){for(j=0;j<n;j++){mp1[i][j]=max(mp1[i][j],mp1[i][k]*mp1[k][j]);}}}int flag=0;for(i=0;i<n;i++){if(mp1[i][i]>1){flag=1;}}printf("Case %d: ",flag1++);if(flag==1)printf("Yes\n");elseprintf("No\n");}return 0;}
阅读全文
0 0
- HDU 1217 Arbitrage
- hdu 1217 Arbitrage--Floyd
- Hdu-1217 Arbitrage
- HDU 1217 Arbitrage
- hdu 1217 Arbitrage
- hdu 1217 Arbitrage
- HDU 1217 Arbitrage
- hdu 1217 Arbitrage
- HDU 1217 Arbitrage
- HDU 1217 Arbitrage
- hdu 1217 Arbitrage
- HDU 1217 Arbitrage
- hdu 1217 Arbitrage
- hdu 1217 Arbitrage
- hdu 1217 Arbitrage
- HDU 1217 Arbitrage 图
- hdu 1217 Arbitrage
- hdu 1217 Arbitrage
- 无名信号量实现相关进程同步
- 民生银行预审额度查询
- 异常
- 计蒜客-作弊揭发者
- 如何用eclipse手动创建动态web项目的xml配置文件及创建动态web项目时一同创建xml配置文件
- hdu 1217 Arbitrage
- 《笨办法学python》加分习题24——我的答案
- 大数据学习3:hadoop编译和伪分布式部署
- python 字典 dict.get的用法
- 全力以赴做一些事情
- HTML学习
- 设备共享iSCSI
- 写 安卓游戏脚本
- ARM中的PC与R15