Codeforces Round #433 (Div. 2)A. Fraction

题目大意

求分子分母和为n的最大真分数。（分子分母互质）

题解

暴力QAQ。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int read()
{
    char ch=getchar();int f=;
    while(ch<'0'||ch>'9') ch=getchar();
    while(ch>='0'&&ch<='9') {f=f*+(ch^);ch=getchar();}
    return f;
}
int gcd(int a,int b)
{
    return !b?a:gcd(b,a%b);
}
int main()
{
    int n,maxx=;
    cin>>n;
    for(int i=;i<=n;i++)
    {
        if(i>=(n-i))
        break;
        if(gcd(i,n-i)==&&(double)((double)i/(double)(n-i))>(double)((double)maxx/(double)(n-maxx)))
        {
            maxx=i;
        }
    }
    cout<<maxx<<" "<<n-maxx;
}