1765M.md (1496B)
1 Source: https://codeforces.com/problemset/problem/1765/M 2 3 M. Minimum LCM 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 512 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 You are given an integer $n$. 22 23 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. 24 25 Input 26 27 The first line contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases. 28 29 The first line of each test case contains a single integer $n$ ($2 \le n \le 10^9$). 30 31 Output 32 33 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. 34 35 Example 36 37 Input 38 39 ``` 40 4 41 42 2 43 44 9 45 46 5 47 48 10 49 ``` 50 51 Output 52 53 ``` 54 1 1 55 3 6 56 1 4 57 5 5 58 ``` 59 60 Note 61 62 In the second example, there are $8$ possible pairs of $a$ and $b$: 63 64 * $a = 1$, $b = 8$, $LCM(1, 8) = 8$; 65 * $a = 2$, $b = 7$, $LCM(2, 7) = 14$; 66 * $a = 3$, $b = 6$, $LCM(3, 6) = 6$; 67 * $a = 4$, $b = 5$, $LCM(4, 5) = 20$; 68 * $a = 5$, $b = 4$, $LCM(5, 4) = 20$; 69 * $a = 6$, $b = 3$, $LCM(6, 3) = 6$; 70 * $a = 7$, $b = 2$, $LCM(7, 2) = 14$; 71 * $a = 8$, $b = 1$, $LCM(8, 1) = 8$. 72 73 In the third example, there are $5$ possible pairs of $a$ and $b$: 74 75 * $a = 1$, $b = 4$, $LCM(1, 4) = 4$; 76 * $a = 2$, $b = 3$, $LCM(2, 3) = 6$; 77 * $a = 3$, $b = 2$, $LCM(3, 2) = 6$; 78 * $a = 4$, $b = 1$, $LCM(4, 1) = 4$.