CF BUDDY
← Problems·

281B · Nearest Fraction

1700 · brute force, implementation, two pointers

Problem: You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction xy\frac{x}{y} 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 xyab\left|\frac{x}{y}-\frac{a}{b}\right| 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 Format: A single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).

Output Format: Print the required fraction in the format "a/b" (without quotes).

Sample Cases

Case 1

Input

3 7 6

Output

2/5

Case 2

Input

7 2 4

Output

7/2

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback