Codeforces 854A Fraction

题目链接：CF-854A

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <string.h>

using namespace std;

int gcd(int x, int y)
{
return y == 0 ? x : gcd(y, x%y);
}

int main() {
int n;
scanf("%d", &n);
int x = n / 2;
int i, j;
if (n % 2 == 1)
{
for (i = x, j = x + 1;i >= 1, j <= n - 1;--i, ++j)
{
if (gcd(i, j) == 1)
{
printf("%d %d", i, j);
break;
}
}
}
else
{
for (i = x - 1, j = x + 1;i >= 1, j <= n - 1;--i, ++j)
{
if (gcd(i, j) == 1)
{
printf("%d %d", i, j);
break;
}
}
}
return 0;
}