HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Forums > Discussion of problems > topic:


Problem "50652 - Prime Factorization"

There is a contest!

В настоящий момент идёт турнир. Некоторая информация и функции сервера недоступны до его окончания.

imesecanOct.07.2015 at 10:11:40 AM
0--- Test 1 ---
12

--- Pattern ---
2 2 3

imesecanJune.29.2016 at 11:17:00 AM
1One algorithm may be as follows:
1) You try to divide the number by two (divisor) as far as the number is divisible. Every time it is divisible by the divisor, you divide it and then you show the divisor on screen.

2) If it is not divisible anymore by this divisor, you increment the divisor

3) And you continue this operation while the number is greater than 1,

For example for 120
num divisor
120 2
60 2
30 2
15 2 (inc divisor)
15 3
5 3 (inc divisor)
5 4 (inc divisor)
5 5
1

irrika22Feb.16.2023 at 04:00:52 PM
2Сообщение скрыто


www.contester.ru