Codeforces #172 div2的B题

最新推荐文章于 2022-11-22 23:15:14 发布

cugbbaoge

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量844

点赞数

分类专栏： acm 文章标签： Baoge codeforces

本文链接：https://blog.csdn.net/cugbbaoge/article/details/8658345

版权

acm 专栏收录该内容

221 篇文章 0 订阅

订阅专栏

You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction $\text{[math]}$ 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 $\text{[math]}$ 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 ≤ 10⁵).

Output

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

       Sample test(s) 
     
         input 
       
3 7 6

         output 
       
2/5

         input 
       
7 2 4

         output 
       
7/2

题目意思还是很清楚的，要找一个分数使得它与x/y的差最小，要求分母b<n，b要最小，分子也最小的那个。

昨晚纠结了半天，还是没纠结出来，今天把它a了。。。。。。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
double go(double xy,int a,int b)
{
    double s=((double)a)/((double)b)-xy;
    if(s>0)return s;
    else return -s;
}
int main()
{
    int x,y,n;
    while(scanf("%d%d%d",&x,&y,&n)!=EOF)
    {
        double xy=((double)x)/((double)y);
        int a,b,j=0;
        double ss=110005,v;
        for(int i=1;i<=n;i++)
        {
            while(go(xy,j,i)>go(xy,j+1,i))j++;
            v=go(xy,j,i);
            if(v<ss)
            {
                ss=v;
                a=j;
                b=i;
            }
            if(ss==0)break;
        }
        cout<<a<<"/"<<b<<endl;
    }
    return 0;
}