题库练习 Minimum LCM
← 上一题 下一题 →

A15665 | Minimum LCM

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given an integer $n$ .

Your task is to find two positive (greater than $0$ ) integers $a$ and $b$ such that $a+b=n$ and the least common multiple (LCM) of $a$ and $b$ is the minimum among all possible values of $a$ and $b$ . If there are multiple answers, you can print any of them.

输入格式

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

The first line of each test case contains a single integer $n$ ( $2 \le n \le 10^9$ ).

输出格式

For each test case, print two positive integers $a$ and $b$ — the answer to the problem. If there are multiple answers, you can print any of them.

输入输出样例

输入 #1
4
2
9
5
10
输出 #1
1 1
3 6
1 4
5 5
C++ 编辑器
输入
输出