题解 | 游游的最小公倍数

#include <stdio.h>
typedef long long ll;

ll gcd(ll a, ll b) {
    while (b != 0) {
        ll temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}
int main(void) {
    int t;
    scanf("%d", &t);

    ll n;
    for (int i = 0; i < t; i++){
        scanf("%lld", &n);

        ll a = n / 2;
        ll b = n - a;
        while(a > 0 && gcd(a, b) != 1)
            a--, b++;

        printf("%lld %lld\n", a, b);
    }
    return 0;
}