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 |
410021999 |
Nov. 20, 2011, 3 p.m. |
Problems
B'You are given integers a, b and c. Calculate ab modulo c. Input data contains numbers a, b and c, one number per line. Each number is an integer between 1 and 100, inclusive. Output ab mod c.'... |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|
3816889 |
Nakilon |
D |
June 2, 2013, 7:53 p.m. |
OK |
Befunge |
TESTS |
50 |
140 |
0 |
|
1700 |
|
3789123 |
SuprDewd |
D |
May 28, 2013, 8:03 p.m. |
OK |
Befunge |
TESTS |
50 |
140 |
0 |
|
1700 |
|
3669372 |
Omelianenko |
D |
May 4, 2013, 1:44 p.m. |
OK |
Befunge |
TESTS |
50 |
140 |
0 |
|
1700 |
|
3625522 |
Phoenyx |
D |
April 25, 2013, 4:23 p.m. |
OK |
Befunge |
TESTS |
50 |
140 |
0 |
|
1700 |
|
3005556 |
romanychda |
D |
Jan. 24, 2013, 10:41 p.m. |
OK |
Befunge |
TESTS |
50 |
140 |
0 |
|
1700 |
|
31313174 |
ljc1301 |
D |
Oct. 14, 2017, 1:51 p.m. |
OK |
Befunge |
TESTS |
50 |
156 |
0 |
|
1700 |
|
14186127 |
130705009 |
D |
Nov. 10, 2015, 3:01 p.m. |
OK |
Befunge |
TESTS |
50 |
156 |
0 |
|
1700 |
|
3816635 |
yermak0v |
D |
June 2, 2013, 6:14 p.m. |
OK |
Befunge |
TESTS |
50 |
156 |
0 |
|
1700 |
|
3427364 |
alp-arslan |
D |
March 31, 2013, 12:44 p.m. |
OK |
Befunge |
TESTS |
50 |
156 |
0 |
|
1700 |
|
23670888 |
Ali.Pi |
D |
Jan. 9, 2017, 8:43 p.m. |
OK |
Befunge |
TESTS |
50 |
156 |
5427200 |
|
1700 |
remove filters
Back to search problems