CF281B.Nearest Fraction

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given three positive integers x,y,nx,y,n . Your task is to find the nearest fraction to fraction whose denominator is no more than nn .

Formally, you should find such pair of integers a,ba,b (1<=b<=n; 0<=a)(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.

输入格式

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

输出格式

Print the required fraction in the format " aa / bb " (without quotes).

输入输出样例

  • 输入#1

    3 7 6
    

    输出#1

    2/5
    
  • 输入#2

    7 2 4
    

    输出#2

    7/2
    
首页