A14679 | $GCD Problem$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Given a positive integer $n$ . Find three distinct positive integers $a$ , $b$ , $c$ such that $a + b + c = n$ and $\operatorname{gcd}(a, b) = c$ , where $\operatorname{gcd}(x, y)$ denotes the [greatest common divisor (GCD)](https://en.wikipedia.org/wiki/Greatest_common_divisor) of integers $x$ and $y$ .

The input consists of multiple test cases. The first line contains a single integer $t$ ( $1 \le t \le 10^5$ ) — the number of test cases. Description of the test cases follows. The first and only line of each test case contains a single integer $n$ ( $10 \le n \le 10^9$ ).

For each test case, output three distinct positive integers $a$ , $b$ , $c$ satisfying the requirements. If there are multiple solutions, you can print any. We can show that an answer always exists.

输入 #1

输出 #1

6 9 3
21 39 3
29 43 1
49 35 7
146 219 73
28622 122661788 2

C++ 编辑器

输入

输出