Unknown Language 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
64 Unknown Language Round 1 FINISHED False 9000 478101623 Feb. 21, 2011, 4 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 295 ) E Prime Segment PROGRAMMING *special brute force 2000

Positive integer number x is called prime , if it has exactly two positive integer divisors. For example, 2, 3, 17, 97 are primes, but 1, 10, 120 are not. You are given an integer number n , find the shortest segment a , b , which contains n (i.e. a ≤ n ≤ b ) and a , b are primes. The only given line contains an integer number n ( 2 ≤ n ≤ 10000 ). Print the space separated pair of the required numbers a , b .

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
3669359 Omelianenko E May 4, 2013, 1:41 p.m. OK Tcl TESTS 18 15 0 2000
568904 KirarinSnow E July 29, 2011, 1:02 a.m. OK Tcl TESTS 18 30 2355200 2000
295990 pes E Feb. 22, 2011, 6:38 a.m. OK Tcl TESTS 18 30 2355200 2000
295145 Ripatti E Feb. 21, 2011, 5:42 p.m. OK Tcl TESTS 18 30 2355200 2000
295117 Aleksey E Feb. 21, 2011, 5:39 p.m. OK Tcl TESTS 18 30 2355200 2000
294901 alexey.enkov E Feb. 21, 2011, 5:21 p.m. OK Tcl TESTS 18 30 2355200 2000
294670 buko E Feb. 21, 2011, 5:05 p.m. OK Tcl TESTS 18 30 2355200 2000
294614 qwaker.00 E Feb. 21, 2011, 5:01 p.m. OK Tcl TESTS 18 30 2355200 2000
294483 Bugman E Feb. 21, 2011, 4:52 p.m. OK Tcl TESTS 18 30 2355200 2000
294350 Orfest E Feb. 21, 2011, 4:43 p.m. OK Tcl TESTS 18 30 2355200 2000

remove filters

Back to search problems