HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Functions > problem:


130. 50652 - Prime Factorization

Guest
• Review clarifications (3)

Volume problems

• 076. 50289 - Monthly Allowance
• 080. 50347 - Selling Oranges
• 090. 50378 - Sum of the given digits
• 095. 50453 - The Cubic Difference
• 100. 50397 - The Number of Points ...
• 110. 50409 - Random Password Ge...
• 120. 50684 - Sum of prime numbers...
• 125. 50578 - Mersenne prime
• 130. 50652 - Prime Factorization
• 132. 50474 - Sum of Two Primes
• 135. 50572 - Palindromic Numbers
• 140. 50393 - Palindromic Numbers
• 145. 50586 - Prime Palindromes
• 148. 50412 - K numbers
• 150. 50375 - Area of Circles
• 160. 50388 - Number of Armstrong ...
• 160. 50571 - Armstrong Numbers - 2

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Prime Factorization

Shqip
The prime factors of a positive integer are the prime numbers that divide that integer exactly, without leaving a remainder. The process of finding these numbers is called integer factorization, or prime factorization.
The prime factorization of a positive integer is a list of the integer's prime factors, together with their multiplicity. For example the prime factors of 12 are 2 x 2 x 3

Input specification
There will be a single number, n, in the input file where 1 ≤ n ≤ 2 billion.

Output specification
Show the prime factors of the given number in increasing order and seperate them by a space.

Input 1 Input 2
12 150
Output 1 Output 2
2 2 3 2 3 5 5

Для отправки решений необходимо выполнить вход.

www.contester.ru