Unknown Language Round 4

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
130 Unknown Language Round 4 FINISHED False 10800 454604423 Nov. 20, 2011, 3 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 300 ) F Prime factorization PROGRAMMING *special 1900

You are given an integer n. Output its prime factorization. If n = a1b1a2b2 ... akbk, where ak are prime numbers, the output of your program should look as follows: a1 a1 ... a1 a2 a2 ... a2 ... ak ak ... ak, where 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 ≤ 250). Output the prime factorization of n, as described above.

Tutorials

Unknown Language Round #4: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
3005558 romanychda F Jan. 24, 2013, 10:42 p.m. OK Befunge TESTS 30 125 0 1900
3064991 hariprasath F Feb. 2, 2013, 5:13 p.m. OK Befunge TESTS 30 140 0 1900
3669376 Omelianenko F May 4, 2013, 1:44 p.m. OK Befunge TESTS 30 156 0 1900
3630471 Phoenyx F April 25, 2013, 6:53 p.m. OK Befunge TESTS 30 156 0 1900
885129 cxyue F Nov. 22, 2011, 2:51 a.m. OK Befunge TESTS 30 160 4300800 1900
883448 kaorimatz F Nov. 21, 2011, 2:06 a.m. OK Befunge TESTS 30 160 4300800 1900
882927 AlexanderBolshakov F Nov. 20, 2011, 6:04 p.m. OK Befunge TESTS 30 160 4300800 1900
882771 SharpC F Nov. 20, 2011, 5:47 p.m. OK Befunge TESTS 30 160 4300800 1900
968385 andrevs F Dec. 19, 2011, 4:49 p.m. OK Befunge TESTS 30 170 4096000 1900
887089 watashi F Nov. 23, 2011, 7:55 a.m. OK Befunge TESTS 30 170 4300800 1900

remove filters

Back to search problems