当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2613:Hero

题目描述
Every one own herself hero. The different hero must be famous in different field. So to compare them is a difficult things. Now given every hero a integer value to express the degree of famous. We call it Fv.
yifenfei want to know who is the most famous hero, so he ask many people to get the answer. Lots of people tell him as that: the Fv of hero A / the Fv of hero B equal to p / q.
输入解释
There are multiple cases in the input file.
Each case contains n (0< n <=27)
Next follow n line, each line as (hero A name # hero B name, p , q ).Length of name less 100 (the name will no ”#”). p, q is A positive integer less 10.
输出解释
Out put every hero relative value, the answer should be smallest(order by the lexicographically of hero name). Out put a line after every case. You may sure every case has answer.
输入样例
1
Zhao yun # ji yuan 4 6

2
Ji yuan # Lemon 3 5
Lemon # Qi shi wang 2 9 
输出样例
Zhao yun 2
ji yuan 3

Ji yuan 6
Lemon 10
Qi shi wang 45
来自杭电HDUOJ的附加信息
Author yifenfei
Recommend yifenfei

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 奋斗的年代

源链接: HDU-2613

最后修改于 2020-10-25T22:55:13+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
3000/1000MS(Java/Others) 32768/32768K(Java/Others)