CF1325A.EhAb AnD gCd

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a positive integer $x$ . Find any such $2$ positive integers $a$ and $b$ such that $GCD(a,b)+LCM(a,b)=x$ .

As a reminder, $GCD(a,b)$ is the greatest integer that divides both $a$ and $b$ . Similarly, $LCM(a,b)$ is the smallest integer such that both $a$ and $b$ divide it.

It's guaranteed that the solution always exists. If there are several such pairs $(a, b)$ , you can output any of them.

输入格式

The first line contains a single integer $t$ $(1 \le t \le 100)$ — the number of testcases.

Each testcase consists of one line containing a single integer, $x$ $(2 \le x \le 10^9)$ .

输出格式

For each testcase, output a pair of positive integers $a$ and $b$ ( $1 \le a, b \le 10^9)$ such that $GCD(a,b)+LCM(a,b)=x$ . It's guaranteed that the solution always exists. If there are several such pairs $(a, b)$ , you can output any of them.

输入输出样例

输入#1
```
2
2
14
```
输出#1
```
1 1
6 4
```

说明/提示

In the first testcase of the sample, $GCD(1,1)+LCM(1,1)=1+1=2$ .

In the second testcase of the sample, $GCD(6,4)+LCM(6,4)=2+12=14$ .

首页