## Prime Factorization

View as PDF

Points: 7
Time limit: 1.0s
Memory limit: 128M

Author:
Problem type

Oh no! Phoenix1369 is taking ICS this semester and once again, he has left his homework to the last minute. Luckily, it only consisted of one question:

Given a list of natural numbers, output the prime factorization of each number.

Unfortunately, he was too busy typing up this problem statement to do it.

Would you write a program that does his homework for him? As compensation, he will gladly reward you with seven points.

#### Input Specification

The input begins with an integer , where , indicating the number of lines to follow.
The next lines will each contain a testcase in the form of a single natural number , where .

#### Output Specification

For each integer , your program should output the prime factorization of on a single line, separated with single spaces and sorted in non-decreasing order.

#### Sample Input

5
3
13
42
666
1369

#### Sample Output

3
13
2 3 7
2 3 3 37
37 37

• commented on Jan. 20, 2021, 12:17 p.m. edited

Tips to avoid TLE in java?

Edit: Figured it out

• commented on Jan. 20, 2021, 12:19 p.m.

BigInteger is slow. Don't use it, as it's not required for this problem.

• commented on Jan. 20, 2021, 9:34 p.m.

You don't even need longs to solve it.