HDU 1217 Arbitrage
来源:互联网 发布:软件压力测试报告模板 编辑:程序博客网 时间:2024/06/03 23:04
Arbitrage
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5027 Accepted Submission(s): 2304
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
Source
University of Ulm Local Contest 1996
题意:给出各国的之间的兑换率,问你能不能通过一直兑换然后赚钱。
Floyd算法,有福权因为有乘法运算。
只要其中一个g[1][1]大于1即Yes。
#include <stdio.h>#include <math.h>#include <vector>#include <map>#include <time.h>#include <string.h>#include <set>#include<iostream>#include <queue>#include <stack>#include <algorithm>using namespace std;#define inf 0x6f6f6f6f#define Max 31int main(){ int n,m,i,j,k,flag,Case; double g[35][35],l; map<string,int>name; char s1[105],s2[105]; Case=1; while(cin>>n,n) { flag=0; for(i=1; i<=n; i++) { cin>>s1; name[s1]=i; } for(i=1; i<=n; i++) for(j=1; j<=n; j++) { if(i==j) g[i][j]=1; else g[i][j]=0; } cin>>m; while(m--) { cin>>s1>>l>>s2; g[name[s1]][name[s2]]=l; } printf("Case %d: ",Case++); for(k=1; k<=n; k++) for(i=1; i<=n; i++) for(j=1; j<=n; j++) { if(g[i][j]<g[i][k]*g[k][j]) g[i][j]=g[i][k]*g[k][j]; } for(i=1;i<=n;i++) { if(g[i][i]>1) { cout<<"Yes"<<endl; flag=1; break; } } if(!flag) cout<<"No"<<endl; }}
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
- 乘法口诀表
- maven安装本地jar包
- 查看fsimage和edits文件
- awk筛选文本行
- UVA1626 - Brackets sequence(区间DP--括号匹配+递归打印)
- HDU 1217 Arbitrage
- angularjs 服务
- io流总结
- 腾讯2014研发笔试
- poj 3167 Cow Patterns (kmp + 线段树/树状数组)
- linux操作系统仿真安装
- 关于spring hibernate连接oracle数据库的配置
- 蓝桥杯之蚂蚁感冒问题
- web性能压力测试工具—webBench详解