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

Arpit Bhayani: submissions
Longest Common Subsequence

ID DATE PROBLEMRESULT TIME MEM LANG
10636254 2013-12-11 09:28:59 Longest Common Subsequence time limit exceeded - 2.0M

C
10636154 2013-12-11 09:14:17 Longest Common Subsequence time limit exceeded - 2.0M

C
10636137 2013-12-11 09:10:22 Longest Common Subsequence time limit exceeded - 2.0M

C
10636113 2013-12-11 09:06:06 Longest Common Subsequence time limit exceeded - 2.2M

C
10636089 2013-12-11 09:01:53 Longest Common Subsequence time limit exceeded - 2.2M

C
10624932 2013-12-09 18:05:37 Longest Common Subsequence runtime error (SIGSEGV) 2.88 256M

C
10624909 2013-12-09 18:02:47 Longest Common Subsequence runtime error (SIGSEGV) 3.86 256M

C
10624883 2013-12-09 17:58:48 Longest Common Subsequence runtime error (SIGSEGV) 3.32 256M

C
10624837 2013-12-09 17:53:48 Longest Common Subsequence runtime error (SIGSEGV) 3.19 256M

C
10624799 2013-12-09 17:49:05 Longest Common Subsequence runtime error (SIGSEGV) 2.22 256M

C
10624782 2013-12-09 17:46:49 Longest Common Subsequence runtime error (SIGSEGV) 2.69 256M

C
10420986 2013-11-05 05:25:11 Longest Common Subsequence time limit exceeded - 3.1M

C++

4.3.2
10420968 2013-11-05 05:19:23 Longest Common Subsequence time limit exceeded - 2.9M

C++

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