Surprise Language Round 6

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
188 Surprise Language Round 6 FINISHED False 7200 399911386 May 25, 2012, 3:30 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 307 ) F Binary Notation PROGRAMMING *special implementation 1600

B'You are given a positive integer n. Output its binary notation. The only line of input data contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106). Output the binary notation of n (without any leading zeros). In the first example 5 xe2 x80 x89= xe2 x80 x891 xe2 x80 x89* xe2 x80 x8922 xe2 x80 x89+ xe2 x80 x890 xe2 x80 x89* xe2 x80 x8921 xe2 x80 x89+ xe2 x80 x891 xe2 x80 x89* xe2 x80 x8920.'...

Tutorials

Surprise Language Round #6: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
2094634 xlk F Sept. 4, 2012, 8:03 a.m. OK Roco TESTS 23 10 307200 1600
2086691 vlad107 F Sept. 1, 2012, 9:19 a.m. OK Roco TESTS 23 10 307200 1600
1723021 bad F May 26, 2012, 11:48 p.m. OK Roco TESTS 23 10 1126400 1600
1717946 irina_kr F May 25, 2012, 5:04 p.m. OK Roco TESTS 23 10 1126400 1600
1717866 fushar F May 25, 2012, 4:59 p.m. OK Roco TESTS 23 10 1126400 1600
1717857 danpol F May 25, 2012, 4:58 p.m. OK Roco TESTS 23 10 1126400 1600
1717712 alonger F May 25, 2012, 4:49 p.m. OK Roco TESTS 23 10 1126400 1600
1717643 kormyshov F May 25, 2012, 4:45 p.m. OK Roco TESTS 23 10 1126400 1600
1717600 sdryapko F May 25, 2012, 4:42 p.m. OK Roco TESTS 23 10 1126400 1600
4079897 Router F July 16, 2013, 8:52 a.m. OK Roco TESTS 23 15 0 1600

remove filters

Back to search problems