309970: CF1765M. Minimum LCM
Memory Limit:512 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Minimum LCM
题意翻译
给出一个整数 $n$,找出两个正整数 $a,b$,使其满足 $a+b=n$ 且 $a,b$ 的最小公倍数为 $a,b$ 的所有可能值中最小的一组。如有多解,输出任意一组。 **有多测。**题目描述
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