1 second
512 megabytes
standard input
standard output
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 ninstead 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.
In the only line of input there is an integer n (3 ≤ n ≤ 1000), the sum of numerator and denominator of the fraction.
Output two space-separated positive integers a and b, numerator and denominator of the maximum possible proper irreducible fraction satisfying the given sum.
3
1 2
4
1 3
12
5 7 题意给你一个n，求最大的分数<1,并且不可约分；
a，b要尽量接近好，所以从a=n/2; b=n-a; 开始枚举
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std; int n,m,a,b; int gcd(int x,int y){
if(y==){
return x;
}
return gcd(y,x%y);
} int main(){
scanf("%d",&n);
if(n%==) a=n/,b=n/; else a=n/,b=n/+;
while(gcd(a,b)!=){
a--;
b++;
}
printf("%d %d",a,b);
}