B. Nearest Fractiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard 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.InputA single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).OutputPrint the required fraction in the format "a/b" (without quotes).ExamplesInput3 7 6Output2/5Input7 2 4Output7/2
Input3 7 6
Output2/5
['brute force', 'implementation', 'two pointers', '*1700']