A10915. k-Factorization
编程题
普及/提高-
知识点
题目描述
Given a positive integer $n$ , find $k$ integers (not necessary distinct) such that all these integers are strictly greater than $1$ , and their product is equal to $n$ .
输入格式
The first line contains two integers $n$ and $k$ ( $2<=n<=100000$ , $1<=k<=20$ ).
输出格式
If it's impossible to find the representation of $n$ as a product of $k$ numbers, print -1.
Otherwise, print $k$ integers in any order. Their product must be equal to $n$ . If there are multiple answers, print any of them.
Otherwise, print $k$ integers in any order. Their product must be equal to $n$ . If there are multiple answers, print any of them.
输入输出样例
输入 #1
100000 2
输出 #1
2 50000
输入 #2
100000 20
输出 #2
-1
输入 #3
1024 5
输出 #3
2 64 2 2 2