Codeforces 854 A Fraction 水题

#include <iostream>
#include <cstdio>
#include <map>
#include <iterator>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;

const int maxn = 1e3+10;
int gcd(int a, int b) {
    return b == 0 ? a : gcd(b, a%b);
}
int main() {
    
    double n;
    cin >> n;
    double ans = -1.;
    double ans1 = 0;
    double ans2 = 0;
    for( double i = 1; i <= n; i++ ) {
        if( i < n-i ) {
            if( gcd(int(i), int(n-i)) == 1) {
                if( i / (n-i) > ans ) {
                    ans1 = i;
                    ans2 = n-i;
                }
            }
        }
    }
    cout << ans1 << " " << ans2 << endl;
    return 0;
}