博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
poj 2240
阅读量:7081 次
发布时间:2019-06-28

本文共 2854 字,大约阅读时间需要 9 分钟。

Arbitrage
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 14832   Accepted: 6255

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

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

简单floyd
#include
#include
using namespace std;int n,m;double map[35][35];char a[50][50];int locate(char *ss){ //确定节点编号 for(int i=1;i<=n;i++){ if(strcmp(ss,a[i])==0) return i; }}int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int cas=1; while(scanf("%d",&n)!=EOF&&n){ for(int i=1;i<=n;i++) scanf("%s",a[i]); scanf("%d",&m); memset(map,0,sizeof(map)); for(int i=1;i<=m;i++){ char s1[50],s2[50]; double s; scanf("%s%lf%s",s1,&s,s2); map[locate(s1)][locate(s2)]=s; } for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) for(int k=1;k<=n;k++) if(map[i][j]
1.0) break; if(i<=n) printf("Case %d: Yes\n",cas); else printf("Case %d: No\n",cas); cas++; } return 0;}

转载地址:http://lgpml.baihongyu.com/

你可能感兴趣的文章
ssh配置文件详解
查看>>
docker run 与docker start的区别,为容器命名
查看>>
Kali 2.0使用SSH进行远程登录
查看>>
阿里CEO张勇首谈商业未来:大数据将成新能源
查看>>
shell基础(二)cut用法
查看>>
类的属性总结
查看>>
在64位Win7下为HP LaserJet 1012安装网络打印机驱动
查看>>
电子邮件地址策略
查看>>
如何快速安装Webmin(linux系统web管理配置工具)
查看>>
PHP带头大哥学习的三部曲!
查看>>
apache忽略文件后缀
查看>>
家电奥斯卡后的全球趋势
查看>>
puppet-笔记1
查看>>
.Net组件程序设计之线程、并发管理(二)
查看>>
java 的 &和&&的区别
查看>>
三个夭亡的硅谷新秀,这些初创公司犯的错值得借鉴
查看>>
linux下lvs搭建负载均衡集群
查看>>
19.Silverlight调用webservice上传多个文件
查看>>
代码实现ActionSheet 和 Alert 基本功能
查看>>
crontab排查一例
查看>>