VK Cup 2012 Wild-card Round 1

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
162 VK Cup 2012 Wild-card Round 1 FINISHED False 7200 444408585 March 18, 2012, 3:10 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 1249 ) C Prime factorization PROGRAMMING *special 2200

You are given a positive integer n. Output its prime factorization. If n = a1b1 a2b2 ... akbk (bi > 0), where ak are prime numbers, the output of your program should look as follows: a1*...*a1*a2*...*a2*...*ak*...*ak, where the factors are ordered in non-decreasing order, and each factor ai is printed bi times. The only line of input contains an integer n (2 ≤ n ≤ 10000). Output the prime factorization of n, as described above.

Tutorials

VK Cup 2012 Wild-card Round 1: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
4554209 DarthShrine C Sept. 25, 2013, 10:17 a.m. OK Factor TESTS 27 156 0 2200
1377738 Orfest C March 18, 2012, 5:37 p.m. OK Factor TESTS 27 160 185856000 2200
1376724 kohyatoh C March 18, 2012, 4:06 p.m. OK Factor TESTS 27 170 185856000 2200
1377328 Martynas C March 18, 2012, 4:51 p.m. OK Factor TESTS 27 170 189030400 2200
1376924 yury_chameleon C March 18, 2012, 4:20 p.m. OK Factor TESTS 27 170 189030400 2200
1505071 ddrone C April 8, 2012, 7:43 p.m. OK Factor TESTS 27 190 185856000 2200
1377115 winger C March 18, 2012, 4:36 p.m. OK Factor TESTS 27 190 185856000 2200
1377800 zcwwzdjn C March 18, 2012, 5:58 p.m. OK Factor TESTS 27 190 189132800 2200
1376668 citxx C March 18, 2012, 4:01 p.m. OK Factor TESTS 27 190 189132800 2200
1377180 vkuzkokov C March 18, 2012, 4:41 p.m. OK Factor TESTS 27 200 189132800 2200

remove filters

Back to search problems