A13305 | $EhAb AnD gCd$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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

C++ 编辑器

输入

输出