题库练习 Nearest Fraction
← 上一题 下一题 →

A8922 | Nearest Fraction

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given three positive integers $x,y,n$ . Your task is to find the nearest fraction to fraction ![](/uploads/acgo/image/1bc937ed370797aa_80add26a321a.jpeg) whose denominator is no more than $n$ .

Formally, you should find such pair of integers $a,b$ $(1<=b<=n; 0<=a)$ that the value ![](/uploads/acgo/image/688d450ec8d4cf9f_cc4037c6b7be.jpeg) is as minimal as possible.

If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.

输入格式

A single line contains three integers $x,y,n$ $(1<=x,y,n<=10^{5})$ .

输出格式

Print the required fraction in the format " $a$ / $b$ " (without quotes).

输入输出样例

输入 #1
3 7 6
输出 #1
2/5
输入 #2
7 2 4
输出 #2
7/2
C++ 编辑器
输入
输出