3637：Find a Fraction

题目描述

Given two non-negative rational numbers A and B(A<B), your task is to find a fraction between (A,B).
Maybe there're many fractions in this interval. In this condition, output the fraction with the smallest sum of its denominator and molecular.

输入解释

The first line is an integer T(<=25) indicating the case number.
The next T lines each contains two strings, namely A and B.
A rational number contains characters '0'~'9','.','[',']' only.
Digits between '[' and ']' are recurring decimal's cycle parts.(0.[6] = 0.666...,etc.)
You may assume the input are all logical, and all the strings are no more than 16.

输出解释

For each case, output a fraction(as the format below) with the smallest sum of its denominator and molecular.

输入样例

4
0 0.5
0.[6] 0.[7]
11.0[8] 11.1[5]
1.[142857] 3.[142857]

输出样例

Case 1: 1/3
Case 2: 3/4
Case 3: 78/7
Case 4: 2/1

来自杭电HDUOJ的附加信息

Author	MadFrog
Recommend	lcy

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

题目来源 2010 ACM-ICPC Multi-University Training Contest（19）——Host by HDU

源链接： HDU-3637

最后修改于 2020-10-25T23:05:29+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)