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
Tribonacci numbers are a sequence of numbers, defined as follows: You are given n; calculate n-th tribonacci number modulo 26. The only line of input contains an integer n (1 ≤ n ≤ 1000). Output n-th tribonacci number modulo 26. |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|
882531 |
I_love_47 |
E |
Nov. 20, 2011, 5:22 p.m. |
OK |
Befunge |
TESTS |
40 |
200 |
4300800 |
|
1800 |
|
3630359 |
Phoenyx |
E |
April 25, 2013, 6:38 p.m. |
OK |
Befunge |
TESTS |
40 |
296 |
0 |
|
1800 |
|
882035 |
draftcode |
E |
Nov. 20, 2011, 4:36 p.m. |
OK |
Befunge |
TESTS |
40 |
330 |
4300800 |
|
1800 |
|
61402310 |
vjudge4 |
E |
Sept. 28, 2019, 5:44 a.m. |
OK |
Befunge |
TESTS |
40 |
342 |
0 |
|
1800 |
|
3005557 |
romanychda |
E |
Jan. 24, 2013, 10:41 p.m. |
OK |
Befunge |
TESTS |
40 |
359 |
0 |
|
1800 |
|
887066 |
watashi |
E |
Nov. 23, 2011, 7:45 a.m. |
OK |
Befunge |
TESTS |
40 |
360 |
4300800 |
|
1800 |
|
885150 |
scottai1 |
E |
Nov. 22, 2011, 3:34 a.m. |
OK |
Befunge |
TESTS |
40 |
380 |
4300800 |
|
1800 |
|
882073 |
ChaoX |
E |
Nov. 20, 2011, 4:40 p.m. |
OK |
Befunge |
TESTS |
40 |
380 |
4300800 |
|
1800 |
|
881726 |
osa_k |
E |
Nov. 20, 2011, 4:11 p.m. |
OK |
Befunge |
TESTS |
40 |
380 |
4300800 |
|
1800 |
|
881743 |
Mick_Nick |
E |
Nov. 20, 2011, 4:13 p.m. |
OK |
Befunge |
TESTS |
40 |
390 |
4300800 |
|
1800 |
remove filters
Back to search problems