SDNU_ACM_ICPC_2020_Winter_Practice_1st A

topic

Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction is called proper iff its numerator is smaller than its denominator (a < b) and that the fraction is called irreducible if its numerator and its denominator are coprime (they do not have positive common divisors except 1).

During his free time, Petya thinks about proper irreducible fractions and converts them to decimals using the calculator. One day he mistakenly pressed addition button ( + ) instead of division button (÷) and got sum of numerator and denominator that was equal to n instead of the expected decimal notation.

Petya wanted to restore the original fraction, but soon he realized that it might not be done uniquely. That’s why he decided to determine maximum possible proper irreducible fraction such that sum of its numerator and denominator equals n. Help Petya deal with this problem.

Input
In the only line of input there is an integer n (3 ≤ n ≤ 1000), the sum of numerator and denominator of the fraction.

The Output
the Output-Space Separated TWO positive integers A and B, The numerator and denominator of satisfying maximum Possible PROPER The irreducible fraction GIVEN SUM.

Effect:
the number of the input split into two numbers a, b. a, b are coprime, such that the determined maximum cases a / b.

AC Code:

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int a,int b)
{
    while(b^=a^=b^=a%=b);return a;
}
int main()
{
    int a,b,sum;
    cin>>sum;
    a=sum/2;
    b=sum-a;
    for(int i=a;i>=1;i--)
    {
        if(gcd(a,b)==1){cout<<a<<" "<<b;break;}
        a--;
        b++;
    }
    return 0;
}