6187: [GESP202406 五级] 小杨的幸运数字
内存限制：256 MB
时间限制：2 S
题面：传统
评测方式：文本比较
上传者：
提交：0
通过：0
题目描述
B. Nearest Fraction
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given three positive integers x,y,n. Your task is to find the nearest fraction to fraction 
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
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.
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
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.
Input
A single line contains three integers x,y,n (1≤x,y,n≤105).
Output
Print the required fraction in the format "a/b" (without quotes).
Examples
Input
3 7 6
Output
2/5
Input
7 2 4
Output
7/2
输入样例 复制
输出样例 复制