A13228. Product of Three Numbers
编程题
普及/提高-
知识点
题目描述
You are given one integer number $n$ . Find three distinct integers $a, b, c$ such that $2 \le a, b, c$ and $a \cdot b \cdot c = n$ or say that it is impossible to do it.
If there are several answers, you can print any.
You have to answer $t$ independent test cases.
If there are several answers, you can print any.
You have to answer $t$ independent test cases.
输入格式
The first line of the input contains one integer $t$ ( $1 \le t \le 100$ ) — the number of test cases.
The next $n$ lines describe test cases. The $i$ -th test case is given on a new line as one integer $n$ ( $2 \le n \le 10^9$ ).
The next $n$ lines describe test cases. The $i$ -th test case is given on a new line as one integer $n$ ( $2 \le n \le 10^9$ ).
输出格式
For each test case, print the answer on it. Print "NO" if it is impossible to represent $n$ as $a \cdot b \cdot c$ for some distinct integers $a, b, c$ such that $2 \le a, b, c$ .
Otherwise, print "YES" and any possible such representation.
Otherwise, print "YES" and any possible such representation.
输入输出样例
输入 #1
5 64 32 97 2 12345
输出 #1
YES 2 4 8 NO NO NO YES 3 5 823