Nearest Fraction
题目描述
B. Nearest Fraction
time limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputYou 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.
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
题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 2167 题。保留原作者与原赛事署名。