#680. 1684. [Usaco2005 Oct]Close Encounter
1684. [Usaco2005 Oct]Close Encounter
#1684. [Usaco2005 Oct]Close Encounter
题目描述
Lacking even a fifth grade education, the cows are having trouble with a fraction problem from their textbook. Please help them. The problem is simple: Given a properly reduced fraction (i.e., the greatest common divisor of the numerator and denominator is 1, so the fraction cannot be further reduced) find the smallest properly reduced fraction with numerator and denominator in the range 1..32,767 that is closest (but not equal) to the given fraction. 找一个分数它最接近给出一个分数. 你要找的分数的值的范围在1..32767
输入格式
- Line 1: Two positive space-separated integers N and D (1 <= N < D <= 32,767), respectively the numerator and denominator of the given fraction
输出格式
- Line 1: Two space-separated integers, respectively the numerator and denominator of the smallest, closest fraction different from the input fraction.
样例
样例输入
2 3
样例输出
21845 32767
OUTPUT DETAILS:
21845/32767 = .666676839503.... ~ 0.666666.... = 2/3.