Arbitrage(hdu 1217 最短路)
来源:互联网 发布:开淘宝网店的流程保证金 编辑:程序博客网 时间:2024/04/28 15:05
Arbitrage
HDU - 1217Arbitrage 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.
InputThe 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.
OutputFor each test case, print one line telling whether arbitrage is possible or not in the format "Case case: Yes" respectively "Case case: No".
Sample Input3
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 OutputCase 1: Yes
Case 2: No
刚开始map不怎么会用,被坑了一把
#include<stdio.h>#include<iostream>#include<map>using namespace std;map<string,int>name;#define MAXN 30double g[MAXN][MAXN];#define typec doublevoid floyed(typec dis[][MAXN],int n){ int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(dis[i][j]<dis[i][k]*dis[k][j]) dis[i][j]=dis[i][k]*dis[k][j];}int main(){ int n,i,m,j; string str1,str2; double r; int iCase=0; while(scanf("%d",&n),n) { iCase++; for(i=1;i<=n;i++) { cin>>str1; name[str1]=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; } scanf("%d",&m); while(m--) { cin>>str1>>r>>str2; g[name[str1]][name[str2]]=r; } floyed(g,n); bool flag=false; for(i=1;i<=n;i++) if(g[i][i]>1) {flag=true;break;} if(flag) printf("Case %d: Yes\n",iCase); else printf("Case %d: No\n",iCase); } return 0;}
0 0
- HDU 1217Arbitrage(FLODY最短路)
- hdu 1217 Arbitrage(最短路)
- Arbitrage(hdu 1217 最短路)
- hdu--Arbitrage(最短路)
- 1217 Arbitrage(最短路)
- hdu 1217 Arbitrage(Floyd最短路算法+map应用)
- 文章标题 HDU 1217 : Arbitrage(最短路--Floyd+map)
- HDU 1217 Arbitrage(最短路判断负环)
- HDU 1217 Arbitrage 乘法最短路
- hdu 1217 && poj2240 Arbitrage 最短路
- HDU 1217 Arbitrage 【最短路,map+spfa】
- HDOJ 1217 Arbitrage (最短路 Floyd)
- 【最短路+floyd】杭电 hdu 1217 Arbitrage
- hdu 1217 Arbitrage(最短路--floyd+对数的性质)
- hdu 1217 Arbitrage 最短路 floyd+map容器
- HDU 1217 Arbitrage(最短路spfa判环)
- POJ2240 Arbitrage(最短路)
- [ACM] hdu 1217 Arbitrage (bellman_ford最短路,判断是否有正权回路或Floyed)
- 软件开发中,各个字符集之间的区别
- redis作为消息队列的使用
- activity 的启动模式
- 启动活动的最佳写法
- 最长递归子序列
- Arbitrage(hdu 1217 最短路)
- 基于OSGi的JSF Web组件开发问题求解
- 选择控件:select ,radio,checkbox之用jquery获取选中值的小结
- RBAC原理介绍及开源框架kasai使用分析
- webService的初步认识和简单用例
- 编程技术书列表
- Unsupported method: AndroidProject.getPluginGeneration()
- 第二章 继承(一)
- Windows工作必备注册表信息,右键开动DOS窗口到特定目录