Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) A. Fraction

题意：2个数A,B，A+B==n,并且A<B，问最大的A/B是多少，A与B互质

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+100;
typedef long long ll;


int main(){
    int n;
    cin>>n;
    for(int i=n/2;i>=1;i--){
        int y=n-i;
        if(__gcd(i,y)==1){
            cout<<i<<" "<<y<<endl;return 0;
        }
    }
}