Private submission
Private submission won't be visible to other users and
won't be taken into consideration in ranks.
Disqualify submission
Your submission will be disqualified. Operation
is not reversible.
Hidden submission
Public submission
Click here to view source code.

Source code of every submission to this problem
in this contest is public.
Help

: submissions

ID DATE PROBLEMRESULT TIME MEM LANG
22460538 2018-10-07 20:22:31 Minimal Possible String wrong answer 0.00 16M

CPP14

22460527 2018-10-07 20:21:19 Minimal Possible String runtime error (SIGSEGV) 0.10 528M

CPP14

22460523 2018-10-07 20:20:29 Minimal Possible String time limit exceeded - 580M

CPP14

22460405 2018-10-07 20:01:59 Kompići accepted 0.07 10M

C

22460396 2018-10-07 20:00:43 Kompići wrong answer 0.00 2.8M

C++

4.3.2

22460382 2018-10-07 19:59:09 Kompići wrong answer 0.00 2.8M

C++

4.3.2

22460378 2018-10-07 19:58:42 Kompići compilation error - -

C++

4.3.2

22460373 2018-10-07 19:58:05 Kompići compilation error - -

C++

4.3.2

21658441 2018-05-14 14:17:53 Easy Dijkstra Problem accepted 0.00 16M

CPP

21658438 2018-05-14 14:16:51 Easy Dijkstra Problem wrong answer 0.00 15M

CPP

21658433 2018-05-14 14:15:19 Easy Dijkstra Problem wrong answer 0.00 16M

CPP

21655362 2018-05-13 20:09:30 Longest path in a tree accepted 0.01 16M

CPP

21655319 2018-05-13 19:58:33 Is it a tree accepted 0.00 16M

CPP

21655311 2018-05-13 19:56:35 Is it a tree time limit exceeded - 2957M

CPP

21655302 2018-05-13 19:53:31 Is it a tree time limit exceeded - 3056M

CPP

21655259 2018-05-13 19:38:29 The Knapsack Problem accepted 0.01 31M

CPP

21655252 2018-05-13 19:35:00 The Knapsack Problem accepted 0.00 31M

CPP

21655203 2018-05-13 19:21:12 Longest Common Subsequence time limit exceeded - 16M

CPP

21655202 2018-05-13 19:21:04 Longest Common Subsequence wrong answer 0.00 16M

CPP

21654895 2018-05-13 18:06:14 Longest Common Subsequence time limit exceeded - 16M

CPP

code...
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.