Factorization into prime numbers
Easy
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
To decompose a natural number into its prime factors.
Write a function that takes a number as input and returns a list of its prime factors in ascending order, including repetitions.
Input
A single natural number greater than one and not exceeding 2·10^9.
Output
Output the result of the function in the format demonstrated in the example.
Examples
Input #1
Answer #1
Submissions 1K
Acceptance rate 24%