Datasets:
wetsoledrysoul
/
CodeNet_runtime_errors

Dataset card Data Studio Files
xet
 Community
1
s_id
stringlengths
10
10
p_id
stringlengths
6
6
u_id
stringlengths
10
10
date
stringlengths
10
10
language
stringclasses
1 value
original_language
stringclasses
11 values
filename_ext
stringclasses
1 value
status
stringclasses
1 value
cpu_time
stringlengths
1
5
memory
stringlengths
1
7
code_size
stringlengths
1
6
code
stringlengths
1
539k
s524979705
p02235
u613805578
1453729777
Python
Python
py
Runtime Error
0
0
379
def lcs(): ???x = raw_input() y = raw_input() ???x_len = len(x) y_len = len(y) z2 = [0 for i in range(y_len+1)] for i in range(x_len): z1 = z2 + [] ele = x[i] for k in range(y_len): if ele == y[k]: z2[k+1] = z1[k] + 1 elif z2[k+1] < z2[k]:??? ????????? z2[k+1] = z2[k] return z2[-1] num = input() for l in range(num): print lcs()
s102536715
p02235
u613805578
1453729933
Python
Python
py
Runtime Error
0
0
379
def lcs(): ???x = raw_input() y = raw_input() ???x_len = len(x) y_len = len(y) z2 = [0 for i in range(y_len+1)] for i in range(x_len): z1 = z2 + [] ele = x[i] for k in range(y_len): if ele == y[k]: z2[k+1] = z1[k] + 1 elif z2[k+1] < z2[k]:??? ????????? z2[k+1] = z2[k] return z2[-1] num = input() for j in range(num): print lcs()
s121524820
p02235
u613805578
1453730418
Python
Python
py
Runtime Error
0
0
371
def lcs() x = raw_input() y = raw_input() x_len = len(x) y_len = len(y) z2 = [0 for i in range(y_len+1)] for i in range(x_len): z1 = z2 + [] ele = x[i] for k in range(y_len): if ele == y[k]: z2[k+1] = z1[k] + 1 elif z2[k+1] < z2[k]:??? z2[k+1] = z2[k] return z2[-1] num = input() for j in range(num): print lcs()
s602244748
p02235
u613805578
1453731306
Python
Python
py
Runtime Error
0
0
372
def lcs(): x = raw_input() y = raw_input() x_len = len(x) y_len = len(y) z2 = [0 for i in range(y_len+1)] for i in range(x_len): z1 = z2 + [] ele = x[i] for k in range(y_len): if ele == y[k]: z2[k+1] = z1[k] + 1 elif z2[k+1] < z2[k]:??? z2[k+1] = z2[k] return z2[-1] num = input() for j in range(num): print lcs()
s155105520
p02235
u824216249
1453742312
Python
Python
py
Runtime Error
0
0
892
q = int(input()) def Longest_Common(q) : X = raw_input() Y = raw_input() dp = [ [0 for i in range( len(X) )] for j in range( len(Y) )] #???X??????Y????????????????????? for j in range( len(Y) ): if Y[j] == X[0] : dp[j][0] += 1 if( j+1 <= len(Y) - 1 ) : dp[j+1][0] = dp[j][0] for i in range( 1,len(X) ): if X[i] == Y[0] : dp[0][i] += 1 if( i+1 <= len(X) - 1 ) : dp[i+1][0] = dp[i][0] for i in range( 1,len(X) ): for j in range( 1,len(Y) ): if X[i] == Y[j] : dp[j][i] = max( dp[j-1][i-1], dp[j-1][i], dp[j][i-1]) + 1 else : dp[j][i] = max( dp[j-1][i-1], dp[j-1][i], dp[j][i-1]) print dp[ len(Y)-1 ][ len(X)-1 ] if( q == 1 ) : return else : Longest_Common(q-1) Longest_Common(q)
s154662926
p02235
u824216249
1453742565
Python
Python
py
Runtime Error
0
0
895
q = int(input()) def Longest_Common(q) : X = raw_input() Y = raw_input() dp = [ [0 for i in range( len(X) )] for j in range( len(Y) )] #???X??????Y????????????????????? for j in range( len(Y) ): if Y[j] == X[0] : dp[j][0] += 1 if( j+1 <= len(Y) - 1 ) : dp[j+1][0] = dp[j][0] for i in range( 1,len(X) ): if X[i] == Y[0] : dp[0][i] += 1 if( i+1 <= len(X) - 1 ) : dp[0][i+1] = dp[0][i+1] for i in range( 1,len(X) ): for j in range( 1,len(Y) ): if X[i] == Y[j] : dp[j][i] = max( dp[j-1][i-1], dp[j-1][i], dp[j][i-1]) + 1 else : dp[j][i] = max( dp[j-1][i-1], dp[j-1][i], dp[j][i-1]) print dp[ len(Y)-1 ][ len(X)-1 ] if( q == 1 ) : return else : Longest_Common(q-1) Longest_Common(q)
s914957519
p02235
u824216249
1453742729
Python
Python
py
Runtime Error
0
0
894
q = int(input()) def Longest_Common(q) : X = raw_input() Y = raw_input() dp = [ [0 for i in range( len(X) )] for j in range( len(Y) )] #???X??????Y????????????????????? for j in range( len(Y) ): if Y[j] == X[0] : dp[j][0] += 1 if( j+1 <= len(Y) - 1 ) : dp[j+1][0] = dp[j][0] for i in range( 1,len(X) ): if X[i] == Y[0] : dp[0][i] += 1 if( i+1 <= len(X) - 1 ) : dp[0][i+1] = dp[0][i+1] for i in range( 1,len(X) ): for j in range( 1,len(Y) ): if X[i] == Y[j] : dp[j][i] = max( dp[j-1][i-1], dp[j-1][i], dp[j][i-1]) + 1 else : dp[j][i] = max( dp[j-1][i-1], dp[j-1][i], dp[j][i-1]) print dp[ len(Y)-1 ][ len(X)-1 ] if( q == 1 ) : return else : Longest_Common(q-1) Longest_Common(q)
s793797603
p02235
u803327846
1453783957
Python
Python
py
Runtime Error
0
0
191
q = input() for i in range(q): X[i] = raw_input() Y[i] = raw_input() for i in range(q): count = 0 for j in range(q): if X[i][j] == Y[i][j]: count += 1 print count
s550577657
p02235
u177295149
1453793793
Python
Python
py
Runtime Error
0
0
393
def com(): ????x = raw_input() ????a = len(x) y = raw_input() ????b = len(y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [ ] ????????for j in range(b): ????????????if k1[j+1] < k1[j]: ???????????????? k1[j+1] = k1[j] ???? elif x[i] == y[j]: ???????????????? k1[j+1] = k2[j] + 1 ??????????return k1[-1] n = input() for l in range(n): ????print com()
s664544802
p02235
u177295149
1453793871
Python
Python
py
Runtime Error
0
0
385
def com(): ????x = raw_input() ????a = len(x) y = raw_input() ????b = len(y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [ ] ????????for j in range(b): ????????????if k1[j+1] < k1[j]: ???????????????? k1[j+1] = k1[j] ???? elif x[i] == y[j]: ???????????????? k1[j+1] = k2[j] + 1 return k1[-1] n = input() for l in range(n): ????print com()
s849590189
p02235
u177295149
1453793986
Python
Python
py
Runtime Error
0
0
382
def com(): ????x = raw_input() ????a = len(x) y = raw_input() ????b = len(y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [ ] ????????for j in range(b): ????????????if k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] ???? elif x[i] == y[j]: ?????????????? k1[j+1] = k2[j] + 1 return k1[-1] n = input() for l in range(n): ????print com()
s572527942
p02235
u177295149
1453794143
Python
Python
py
Runtime Error
0
0
376
def com(): ????x = raw_input() ????a = len(x) y = raw_input() ????b = len(y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [ ] ????????for j in range(b): ???? if x[i] == y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print com()
s670749356
p02235
u630265299
1453797143
Python
Python
py
Runtime Error
0
0
411
def solve_lcs(): x = raw_input() y = raw_input() a = len(x) y = len(y) c1 = [0 for i in range(b+1)] for i in range(a): e1 = x[i] c2 = c1+[] for j in range(b): if e1 == y[j]: c1[j+1] = c2[j] + 1 elif c1[j+1] < c1[j]: c1[j+1] = c1[j] return c1[-1] n = input() for i2 in range(n): print solve_lcs()
s515464036
p02235
u619765879
1453803915
Python
Python
py
Runtime Error
0
0
503
def lcs(x, y) for i in range(1, len(x)): for j in range(1, lem(y)): if x[i] = y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j]>c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] if maxl<c[i][j]: maxl = c[i][j] return maxl q = input() x = [' ' for row in range(n+1)] y = [' ' for row in range(n+1)] c = [[' ' for col in range(1000)] for row in range(1000)] maxl = 0 for i in range(q): x = input() y = input() print lcs(x, y)
s191422318
p02235
u563876281
1453804334
Python
Python
py
Runtime Error
0
0
295
def sakujo(); url1 = raw_input() url2 = raw_input() a, b = len(url1), len(url2) x = [0 for i in range(b+1)] for i in range(a): e1 = url1[i] y = x+[] for j in range(b): if e1 == url2[j]: x[j+1] = y[j] + 1 elif x1[j+1] < x[j]: x[j+1] = x[j] return x[-1] n=input() for ix in range(n): def sakujo
s271213889
p02235
u563876281
1453804350
Python
Python
py
Runtime Error
0
0
304
def sakujo(); seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) x1 = [0 for i in range(b+1)] for i in range(a): e1 = seq1[i] x2 = x1+[] for j in range(b): if e1 == seq2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n=input() for ix in range(n): def sakujo
s674671889
p02235
u563876281
1453804430
Python
Python
py
Runtime Error
0
0
303
def sakujo(); seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) x1 = [0 for i in range(b+1)] for i in range(a): e1 = seq1[i] x2 = x1+[] for j in range(b): if e1 == seq2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n=input() for i in range(n): def sakujo
s027710502
p02235
u563876281
1453804505
Python
Python
py
Runtime Error
0
0
304
def sakujo(); seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) x1 = [0 for i in range(b+1)] for i in range(a): e1 = seq1[i] x2 = x1+[] for j in range(b): if e1 == seq2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n=input() for ix in range(n): def sakujo
s845799124
p02235
u619765879
1453804511
Python
Python
py
Runtime Error
0
0
513
def lcs(x, y): for i in range(1, len(x)): for j in range(1, len(y)): if x[i] == y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j]>c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] if maxl<c[i][j]: maxl = c[i][j] return maxl q = input() x = [' ' for row in range(q+1)] y = [' ' for row in range(q+1)] c = [[' ' for col in range(1000)] for row in range(1000)] maxl = 0 for i in range(q): x = raw_input() y = raw_input() print lcs(x, y)
s823582700
p02235
u563876281
1453804917
Python
Python
py
Runtime Error
0
0
337
def sakujo(): moji1 = raw_input() moji2 = raw_input() a, b = len(moji1), len(moji2) x1 = [for i in range(b+1)] for i in range(a): e1 = seq1[i] x2 = x1+[] for j in range(b): if e1 == moji2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n=input() for ix in range(n): def sakujo
s936511696
p02235
u563876281
1453804924
Python
Python
py
Runtime Error
0
0
339
def sakujo(): moji1 = raw_input() moji2 = raw_input() a, b = len(moji1), len(moji2) x1 = [0 for i in range(b+1)] for i in range(a): e1 = seq1[i] x2 = x1+[] for j in range(b): if e1 == moji2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n=input() for ix in range(n): def sakujo
s974849770
p02235
u563876281
1453804939
Python
Python
py
Runtime Error
0
0
340
def sakujo(): moji1 = raw_input() moji2 = raw_input() a, b = len(moji1), len(moji2) x1 = [0 for i in range(b+1)] for i in range(a): e1 = moji1[i] x2 = x1+[] for j in range(b): if e1 == moji2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n=input() for ix in range(n): def sakujo
s921734410
p02235
u619765879
1453805260
Python
Python
py
Runtime Error
110
15148
522
def lcs(maxl): for i in range(1, len(x)): for j in range(1, len(y)): if x[i] == y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j]>c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] if maxl<c[i][j]: maxl = c[i][j] return maxl q = input() x = [' ' for row in range(q+1)] y = [' ' for row in range(q+1)] c = [[0 for col in range(1000)] for row in range(1000)] maxl = 0 for i in range(q): x = ' ' + raw_input() y = ' ' + raw_input() print lcs(maxl)
s990072147
p02235
u619765879
1453805271
Python
Python
py
Runtime Error
120
15036
522
def lcs(maxl): for i in range(1, len(x)): for j in range(1, len(y)): if x[i] == y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j]>c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] if maxl<c[i][j]: maxl = c[i][j] return maxl q = input() x = [' ' for row in range(q+1)] y = [' ' for row in range(q+1)] c = [[0 for col in range(1000)] for row in range(1000)] maxl = 0 for i in range(q): x = ' ' + raw_input() y = ' ' + raw_input() print lcs(maxl)
s036726070
p02235
u619765879
1453805554
Python
Python
py
Runtime Error
0
0
514
def lcs(): for i in range(1, len(x)): for j in range(1, len(y)): if x[i] == y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j]>c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] if maxl<c[i][j]: maxl = c[i][j] return maxl q = input() x = [' ' for row in range(q+1)] y = [' ' for row in range(q+1)] c = [[0 for col in range(1001)] for row in range(1001)] maxl = 0 for i in range(q): x = ' ' + raw_input() y = ' ' + raw_input() print lcs()
s946668381
p02235
u619765879
1453805676
Python
Python
py
Runtime Error
0
0
523
def lcs(maxl): for i in range(1, len(x)): for j in range(1, len(y)): if x[i] == y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j]>c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] if maxl<c[i][j]: maxl = c[i][j] return maxl q = input() x = [' ' for row in range(q+1)] y = [' ' for row in range(q+1)] #c = [[0 for col in range(1001)] for row in range(1001)] maxl = 0 for i in range(q): x = ' ' + raw_input() y = ' ' + raw_input() print lcs(maxl)
s530810961
p02235
u563876281
1453806708
Python
Python
py
Runtime Error
0
0
428
def longest(): moji1 = raw_input() moji2 = raw_input() a, b = len(seq1), len(seq2) x1 = [0 for i in range(b+1)] for i in range(a): e1 = moji1[i] x2 = x1+[] for j in range(b): if e1 == moji2[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return x1[-1] n = input() for i in range(n): print longest()
s498631807
p02235
u619765879
1453807383
Python
Python
py
Runtime Error
0
0
538
def lcs(count): while 1: if i>len(x) or j>len(y): break if x[i] == y[j]: count += 1 i += 1 j += 1 elif j<len(y) and x[i] == y[j+1]: count += 1 i += 1 j += 2 elif i<len(x) and x[i+1] == y[j]: count += 1 i += 2 j += 1 return count q = input() x = ['' for row in range(q+1)] y = ['' for row in range(q+1)] c = [[0 for col in range(1001)] for row in range(1001)] count = 0 for i in range(q): x = ' ' + raw_input() y = ' ' + raw_input() print lcs(maxl)
s715574196
p02235
u803327846
1453808069
Python
Python
py
Runtime Error
0
0
433
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] print c[X][Y] q = input() for i in range(q): LCS()
s732615410
p02235
u803327846
1453808125
Python
Python
py
Runtime Error
0
0
436
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] print c[X][Y] q = input() for i in range(q): LCS()
s496188588
p02235
u803327846
1453808392
Python
Python
py
Runtime Error
0
0
381
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif: max(c[i - 1][j], c[i][j - 1]) print c[X][Y] q = input() for i in range(q): LCS
s845036242
p02235
u803327846
1453808410
Python
Python
py
Runtime Error
0
0
391
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif: c[i][j] = max(c[i - 1][j], c[i][j - 1]) print c[X][Y] q = input() for i in range(q): LCS
s033098078
p02235
u000228958
1453809781
Python
Python
py
Runtime Error
0
0
681
def count(str1, str2): cnt = 0 count_map = [[for j in range(len(str2) + 1)] for i in range(len(str1) + 1)] for i in range(len(str1) + 1): count_map[i][0] = 0 for j in range(len(str2) + 1): count_map[0][j] = 0 for i in range(len(str1)): for j in range(len(str2)): if str1[i] == str2[j]: count_map[i][j] = count_map[i - 1][j - 1] + 1 else: count_map[i][j] = max(count_map[i - 1][j], count_map[i][j - 1]) cnt = max(max, count_map[i][j]) return count_map[i][j] p = input() for i in range(p): X = raw_input() Y = raw_input() ans = count(X, Y) print ans
s415571952
p02235
u803327846
1453810495
Python
Python
py
Runtime Error
0
0
435
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) lcs = 0 for i in range(X + 1): c[i][0] = 0 for j in range(Y + 1): c[0][j] = 0 for i in range(1,X + 1): for j in range(1, Y + 1): if X[i] == Y[j]: c[i][j] = c[i - 1][j - 1] + 1 else: c[i][j] = max(c[i - 1][j], c[i][j - 1]) lcs = max(c[i][j], lcs) print lcs q = input() for i in range(q): LCS()
s188786439
p02235
u803327846
1453810644
Python
Python
py
Runtime Error
0
0
433
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] print c[X][Y] q = input() for i in range(q): LCS()
s077118054
p02235
u000228958
1453810901
Python
Python3
py
Runtime Error
0
0
607
def count(str1, str2): count_map = [[0 for j in range(len(str2) + 1)] for i in range(len(str1) + 1)] for i in xrange(len(str1)): count_map[i][0] = 0 for j in xrange(len(str2)): count_map[0][j] = 0 for i in xrange(len(str1)): for j in xrange(len(str2)): if str1[i] == str2[j]: count_map[i][j] = count_map[i - 1][j - 1] + 1 else: count_map[i][j] = max(count_map[i - 1][j], count_map[i][j - 1]) print count_map[i][j] p = input() for i in xrange(p): X = raw_input() Y = raw_input() count(X, Y)
s915317052
p02235
u803327846
1453811749
Python
Python
py
Runtime Error
0
0
423
def LCS(): seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) for i in range(b + 1): x1[i] = 0 for i in range(a): e1 = seq1[i] c2 = c1+[] for j in range(b): if e1 == seq2[j]: c1[j+1] = c2[j] + 1 elif c1[j+1] < c1[j]: c1[j+1] = c1[j] return c1[-1] n = input() for i in range(n): print LCS()
s180101385
p02235
u803327846
1453811850
Python
Python
py
Runtime Error
0
0
423
def LCS(): seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) for i in range(b + 1): c1[i] = 0 for i in range(a): e1 = seq1[i] c2 = c1+[] for j in range(b): if e1 == seq2[j]: c1[j+1] = c2[j] + 1 elif c1[j+1] < c1[j]: c1[j+1] = c1[j] return c1[-1] n = input() for i in range(n): print LCS()
s027366468
p02235
u803327846
1453811924
Python
Python
py
Runtime Error
0
0
429
def LCS(): seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) for i in range(b + 1): c1[i] = 0 for i in range(a): e1 = seq1[i] c2 = c1+[] for j in range(b): if e1 == seq2[j]: c1[j + 1] = c2[j] + 1 elif c1[j + 1] < c1[j]: c1[j + 1] = c1[j] return c1[-1] n = input() for i in range(n): print LCS()
s608985031
p02235
u803327846
1453811946
Python
Python
py
Runtime Error
0
0
430
def LCS(): seq1 = raw_input() seq2 = raw_input() a, b = len(seq1), len(seq2) for i in range(b + 1): c1[i] = 0 for i in range(a): e1 = seq1[i] c2 = c1+[] for j in range(b): if e1 == seq2[j]: c1[j + 1] = c2[j] + 1 elif c1[j + 1] < c1[j]: c1[j + 1] = c1[j] return c1[-1] n = input() for i2 in range(n): print LCS()
s713509067
p02235
u803327846
1453812086
Python
Python
py
Runtime Error
0
0
428
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] print c[X][Y] q = input() for i in range(q): LCS()
s223603645
p02235
u803327846
1453812408
Python
Python
py
Runtime Error
0
0
452
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 ???x = ' ' + x y = ' ' + y for i in range(1,X+1): for j in range(1,Y+1): if X[i] == Y[i]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j] >= c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] print c[X][Y] q = input() for i in range(q): LCS()
s432090946
p02235
u803327846
1453812677
Python
Python
py
Runtime Error
0
0
432
def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 ???x = ' ' + x y = ' ' + y for i in range(1,X+1): for j in range(1,Y+1): if X[i] == Y[i]: c[i][j] = c[i-1][j-1] + 1 elif c[i-1][j] >= c[i][j-1]: c[i][j] = c[i-1][j] else: c[i][j] = c[i][j-1] q = input() for i in range(q): LCS()
s011780564
p02235
u803327846
1453812986
Python
Python
py
Runtime Error
0
0
440
def LCS(): x = ' ' + raw_input() y = ' ' + raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] print c[X][Y] q = input() for i in range(q): LCS()
s485573357
p02235
u803327846
1453813086
Python
Python
py
Runtime Error
0
0
386
\def LCS(): x = raw_input() y = raw_input() X = len(x) Y = len(y) for i in range(X): c[i][0] = 0 for j in range(Y): c[0][j] = 0 for i in range(X): for j in range(Y): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 else: c[i][j] = max(c[i - 1][j], c[i][j - 1]) print max(c) q = input() for i in xrange(q): LCS
s434793189
p02235
u803327846
1453813428
Python
Python
py
Runtime Error
0
0
449
def LCS(): x = ' ' + raw_input() y = ' ' + raw_input() X = len(x) Y = len(y) maxl = 0 for i in range(1,X+1): c[i][0] = 0 for j in range(1,Y+1): c[0][j] = 0 for i in range(1,X+1): for j in range(1,Y+1): if X[i] == Y[i]: c[i][j] = c[i - 1][j - 1] + 1 else: c[i][j] = max(c[i - 1][j], c[i][j - 1]) maxl = (c[i][j], maxl) return maxl q = input() for i in xrange(q): print LCS
s333773330
p02235
u803327846
1453813762
Python
Python
py
Runtime Error
0
0
378
def LCS(): X = raw_input() Y = raw_input() a, b = len(X), len(Y) c1 = [0 for i in range(b+1)] for i in range(a): c2 = c1+[] for j in range(b): if X[i] == Y[j]: x1[j+1] = x2[j] + 1 elif x1[j+1] < x1[j]: x1[j+1] = x1[j] return c1[-1] n = input() for i in range(n): print LCS()
s787508422
p02235
u803327846
1453813812
Python
Python
py
Runtime Error
0
0
394
def LCS(): X = raw_input() Y = raw_input() a, b = len(X), len(Y) c1 = [0 for i in range(b+1)] for i in range(a): e1 = X[i] c2 = c1+[] for j in range(b): if e1 == Y[j]: c1[j+1] = c2[j] + 1 elif c1[j+1] < c1[j]: c1[j+1] = c1[j] return x1[-1] n = input() for i in range(n): print LCS()
s676471787
p02235
u393769849
1453814157
Python
Python
py
Runtime Error
0
0
414
solve(): seq1 = raw_input() seq2 = raw_input() x, y = len(seq1), len(seq2) a1 = [0 for i in range(y+1)] for i in range(x): e1 = seq1[i] a2 = a1+[] for j in range(y): if e1 == seq2[j]: a1[j+1] = a2[j] + 1 elif a1[j+1] < a1[j]: a1[j+1] = a1[j] return a1[-1] n = input() for i2 in range(n): print solve()
s523508374
p02235
u393769849
1453814278
Python
Python
py
Runtime Error
0
0
417
def solve(): seq1 = raw_input() seq2 = raw_input() x, y = len(seq1), len(seq2) a1 = [0 for i in range(y+1)] for i in range(x): e1 = seq1[i] a2 = a1+[] for j in range(y): if e1 == seq2[j]: a1[j+1] = a2[j] + 1 elif a1[j+1] < a1[j]: a1[j+1] = a1[j] return a1[-1] n = imput() for i2 in range(n): print solve()
s046432645
p02235
u393769849
1453814721
Python
Python
py
Runtime Error
0
0
417
def solve(): seq1 = raw_input() seq2 = raw_input() x, y = len(seq1), len(seq2) a1 = [0 for i in range(y+1)] for i in range(x): e1 = seq1[i] a2 = a1+[] for j in range(y): if e1 == seq2[j]: a1[j+1] = a2[j] + 1 elif a1[j+1] < a1[j]: a1[j+1] = a1[j] return a1[-1] n = imput() for i2 in range(n): print solve()
s822999536
p02235
u177295149
1453817055
Python
Python
py
Runtime Error
0
0
380
def common(): ????x = raw_input() ????a = len(x) y = raw_input() ????b = len(y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if x[i] == y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print common()
s372770071
p02235
u177295149
1453817338
Python
Python
py
Runtime Error
0
0
380
def common(): ????X = raw_input() Y = raw_input() ????a = len(x) ????b = len(y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print common()
s761749649
p02235
u177295149
1453817409
Python
Python
py
Runtime Error
0
0
380
def common(): ????X = raw_input() Y = raw_input() ????a = len(X) ????b = len(Y) ????k1 = [0 for i in range(b+1)] ???? ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print common()
s329422554
p02235
u177295149
1453817589
Python
Python
py
Runtime Error
0
0
380
def common(): ????X = raw_input() Y = raw_input() ????a = len(X) ????b = len(Y) ????k1 = [0 for i in range(b+1)] ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ???? print common()
s897213094
p02235
u177295149
1453817641
Python
Python
py
Runtime Error
0
0
380
def common(): ????X = raw_input() Y = raw_input() ????a = len(X) ????b = len(Y) ????k1 = [0 for t in range(b+1)] ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ???? print common()
s083742670
p02235
u177295149
1453817719
Python
Python
py
Runtime Error
0
0
374
def common(): ????X = raw_input() Y = raw_input() ????a = len(X) ????b = len(Y) ????k1 = [0 for c in range(b+1)] ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print common()
s558820390
p02235
u177295149
1453817852
Python
Python
py
Runtime Error
0
0
374
def common(): ????X = raw_input() Y = raw_input() ????a = len(X) ????b = len(Y) ????k1 = [0 for i in range(b+1)] ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print common()
s174673712
p02235
u177295149
1453817947
Python
Python
py
Runtime Error
0
0
374
def common(): ????X = raw_input() Y = raw_input() ????a = len(X) ????b = len(Y) ????k1 = [0 for i in range(b+1)] ????for i in range(a): ????????k2 = k1 + [] ????????for j in range(b): ???? if X[i] == Y[j]: ?????????????? k1[j+1] = k2[j] + 1 elif k1[j+1] < k1[j]: ????????????????k1[j+1] = k1[j] return k1[-1] n = input() for l in range(n): ????print common()
s786165921
p02235
u177808190
1453819669
Python
Python
py
Runtime Error
0
0
520
def lcs(X, Y): #X = " " + X #Y = " " + Y #c = [[0 for j in xrange(len(Y))] for i in xrange(len(X))] c2 = [0???for i in xrange(len(Y))] #maxl = 0 for i in xrange(1,len(X)): c1 = c2 + [] for j in xrange(1,len(Y)): if X[i] == Y[j]: c2[j + 1] = c1[j] + 1 elif c2[j + 1] < c2[j]: c2[j + 1] = c2[j] return c2[-1] n = int(raw_input()) for i in xrange(n): s1 = raw_input() s2 = raw_input() print lcs(s1, s2)
s067723095
p02235
u731976921
1453842494
Python
Python
py
Runtime Error
40
14212
416
dp = [0] * 1000 for i in range(1000): dp[i] = [0] * 1000 def lcs(s, t): slen = len(s) tlen = len(t) for i in range(1, slen + 1): for j in range(1, tlen + 1): if s[i-1] == t[j-1]: dp[i][j] = dp[i-1][j-1] + 1 else: dp[i][j] = max(dp[i][j-1], dp[i-1][j]) return dp[slen][tlen] n = int(raw_input()) for i in range(n): x = raw_input() y = raw_input() print lcs(x, y)
s040270514
p02235
u731976921
1453842902
Python
Python
py
Runtime Error
60
14212
479
dp = [0] * 1000 for i in range(1000): dp[i] = [0] * 1000 def lcs(s, t): slen = len(s) tlen = len(t) for i in range(1, slen + 1): for j in range(1, tlen + 1): if s[i-1] == t[j-1]: dp[i][j] = dp[i-1][j-1] + 1 else: dp[i][j] = max(dp[i][j-1], dp[i-1][j]) return dp[slen][tlen] n = int(raw_input()) for i in range(n): x = raw_input() y = raw_input() if i >= 20 and (len(y) >= 100 or len(x) >= 100): continue print lcs(x, y)
s033744906
p02235
u885889402
1453860106
Python
Python3
py
Runtime Error
0
0
568
def num_substr(s, t): sl = len(s) tl = len(t) dp = {} for i in range(sl + 1): dp[i] = {0: 0} for j in range(st + 1): dp[0][j] = 0 for i in range(1,sl+1): si_1 = s[i-1] dpi = dp[i] dpi_1 = dp[i-1] for j in range(1,tl+1): d=1 if si_1 == t[j-1] and dpi_1[j-1] == dpi[j-1] else 0 dpi[j] = max(dpi_1[j] , dpi[j-1] +d) return dp[len(s)][len(t)] n = int(input()) for i in range(n): s = input() t = input() print(num_substr(s,t))
s494940796
p02235
u885889402
1453860221
Python
Python
py
Runtime Error
0
0
570
def num_substr(s, t): sl = len(s) tl = len(t) dp = {} for i in range(sl + 1): dp[i] = {0: 0} for j in range(sl + 1): dp[0][j] = 0 for i in range(1,sl+1): si_1 = s[i-1] dpi = dp[i] dpi_1 = dp[i-1] for j in range(1,tl+1): d=1 if si_1 == t[j-1] and dpi_1[j-1] == dpi[j-1] else 0 dp[i][j] = max(dpi_1[j] , dpi[j-1] +d) return dp[len(s)][len(t)] n = int(input()) for i in range(n): s = input() t = input() print(num_substr(s,t))
s074546438
p02235
u885889402
1453860233
Python
Python3
py
Runtime Error
0
0
570
def num_substr(s, t): sl = len(s) tl = len(t) dp = {} for i in range(sl + 1): dp[i] = {0: 0} for j in range(sl + 1): dp[0][j] = 0 for i in range(1,sl+1): si_1 = s[i-1] dpi = dp[i] dpi_1 = dp[i-1] for j in range(1,tl+1): d=1 if si_1 == t[j-1] and dpi_1[j-1] == dpi[j-1] else 0 dp[i][j] = max(dpi_1[j] , dpi[j-1] +d) return dp[len(s)][len(t)] n = int(input()) for i in range(n): s = input() t = input() print(num_substr(s,t))
s437890031
p02235
u885889402
1453860284
Python
Python3
py
Runtime Error
0
0
570
def num_substr(s, t): sl = len(s) tl = len(t) dp = {} for i in range(sl + 1): dp[i] = {0: 0} for j in range(sl + 1): dp[0][j] = 0 for i in range(1,sl+1): si_1 = s[i-1] dpi = dp[i] dpi_1 = dp[i-1] for j in range(1,tl+1): d=1 if si_1 == t[j-1] and dpi_1[j-1] == dpi[j-1] else 0 dp[i][j] = max(dpi_1[j] , dpi[j-1] +d) return dp[len(s)][len(t)] n = int(input()) for i in range(n): s = input() t = input() print(num_substr(s,t))
s781653970
p02235
u885889402
1453860422
Python
Python3
py
Runtime Error
0
0
570
def num_substr(s, t): sl = len(s) tl = len(t) dp = {} for i in range(sl + 1): dp[i] = {0: 0} for j in range(sl + 1): dp[0][j] = 0 for i in range(1,sl+1): si_1 = s[i-1] dpi = dp[i] dpi_1 = dp[i-1] for j in range(1,tl+1): d=1 if si_1 == t[j-1] and dpi_1[j-1] == dpi[j-1] else 0 dp[i][j] = max(dpi_1[j] , dpi[j-1] +d) return dp[len(s)][len(t)] n = int(input()) for i in range(n): s = input() t = input() print(num_substr(s,t))
s104091008
p02235
u797673668
1454244669
Python
Python3
py
Runtime Error
20
7748
522
def lcd(x0, y0): lx, ly = len(x0), len(y0) memo = [[None] * ly for _ in range(lx)] def memoize(x, y): if x < 0 or y < 0: return 0 if memo[x][y] is not None: return memo[x][y] result = memo[x][y] = main(x, y) return result def main(x, y): return memoize(x - 1, y - 1) + 1 if x0[x] == y0[y] else max(memoize(x - 1, y), memoize(x, y - 1)) return main(lx - 1, ly - 1) n = int(input()) while n: print(lcd(input(), input())) n -= 1
s643824946
p02235
u247976584
1455728402
Python
Python3
py
Runtime Error
0
0
578
from sys import stdin def lcs(x, y): m = len(x) n = len(y) c = [[0]*(m + 2) for a in range(n + 2)] for i in range(1, m + 1): for j in range(1, n + 1): if x[i-1] == y[j-1]: c[i][j] = (c[i - 1][j - 1]) + 1 else: c[i][j] = max(c[i - 1][j], c[i][j - 1]) return max(max(c)) n = int(input().rstrip()) strs = stdin.readlines() ret = [] for i in range(n): # s1 = strs[i*2].rstrip() # s2 = strs[i*2+1].rstrip() ret.append(lcs(strs[i*2].rstrip(), strs[i*2+1].rstrip())) print(*ret, sep="\n")
s402912910
p02235
u072053884
1460791419
Python
Python3
py
Runtime Error
0
0
485
def lcs(x, y): lx = len(x) ly = len(y) pcsl = [[0 for j in range(ly + 1)] for i in range(lx + 1)] for i in range(lx): for j in range(ly): if x[i] == y[j]: pcsl[i][j] = pcsl[i - 1][j - 1] + 1 else: pcsl[i][j] = max(pcsl[i - 1][j], pcsl[i][j - 1]) print(pcsl[i][j]) import sys q = sys.stdin.readline() while True: ax = sys.stdin.readline()[:-1] ay = sys.stdin.readline()[:-1] lcs(ax, ay)
s918457355
p02235
u569960318
1467783108
Python
Python3
py
Runtime Error
30
7764
690
def len_LCS(X,Y): D = {} def main(X,Y): if len(X) == 0: return 0 if (X,Y) in D: return D[(X,Y)] if len(X) == 1: D[(X,Y)] = 1 if X[0] in Y else 0 elif X[0] in Y: if Y.index(X[0]) == len(Y)-1: D[(X,Y)] = max(1,main(X[1:],Y[:])) else: D[(X,Y)]= max(main(X[1:],Y[Y.index(X[0])+1:]) + 1,\ main(X[1:],Y[:])) else: D[(X,Y)] = main(X[1:],Y[:]) return D[(X,Y)] return main(X,Y) if __name__=='__main__': n = int(input()) for _ in range(n): X = input() Y = input() print(len_LCS(X,Y))
s825700830
p02235
u881590806
1469457051
Python
Python
py
Runtime Error
0
0
456
def lcs(a,b): dp = [[0 for i in range(len(a)+1)] for j in range(len(b)+1)] for i in range(1,len(a)+1): for j in range(1,len(b)+1): x = 0 if a[i-1]==b[j-1]: x = 1 dp[i][j] = max(dp[i-1][j-1]+x, dp[i][j-1], dp[i-1][j]) return dp[len(a)][len(b)] n = int(raw_input()) s = [] for _ in range(n): a = raw_input() b = raw_input() s.append((a,b)) for a,b in s: print lcs(a,b)
s329901665
p02235
u854552072
1470178674
Python
Python3
py
Runtime Error
60
7672
277
def lcs(X, Y): if not len(X) or not len(Y): return 0 if X[-1] == Y[-1]: return 1 + lcs(X[:-1], Y[:-1]) else: return max(lcs(X[:-1], Y), lcs(X, Y[:-1])) q = int(input()) for i in range(q): X = input() Y = input() print(lcs(X, Y))
s586220451
p02235
u890722286
1476138269
Python
Python3
py
Runtime Error
0
0
431
import sys def lcs(X, Y): c = [0 for _ in range(len(Y) + 1)] for i in X: tmp = c[:] for ji, yc in enumerate(Y): j = ji + 1 if i == yc: c[j] = tmp[j - 1] + 1 else: c[j] = max(tmp[j], c[j - 1]) return c[y - 1] n = int(input()) for i in range(n): X = sys.stdin.readline()[:-1] Y = sys.stdin.readline()[:-1] print(lcs(X, Y))
s082968724
p02235
u460172144
1477236103
Python
Python3
py
Runtime Error
1010
23604
1215
def lcs(X,Y): Xlength = len(X) Ylength = len(Y) # print(X,Y) if Xlength == 0 or Ylength == 0: c[Xlength][Ylength] = 0 return c[Xlength][Ylength] if X[Xlength -1] == Y[Ylength -1]: if c[Xlength-1][Ylength-1] is not None: c[Xlength][Ylength] = c[Xlength-1][Ylength-1]+1 else: c[Xlength][Ylength] = lcs(X[:Xlength-1], Y[:Ylength-1])+1 else: if c[Xlength-1][Ylength] is not None and c[Xlength][Ylength-1] is not None: c[Xlength][Ylength] = max(c[Xlength][Ylength-1],c[Xlength-1][Ylength]) elif c[Xlength-1][Ylength] is not None: c[Xlength][Ylength] = max(lcs(X,Y[:Ylength-1]),c[Xlength-1][Ylength]) elif c[Xlength][Ylength-1] is not None: c[Xlength][Ylength] = max(c[Xlength][Ylength-1],lcs(X[:Xlength-1],Y)) else: c[Xlength][Ylength] = max(lcs(X,Y[:Ylength-1]),lcs(X[:Xlength-1],Y)) return c[Xlength][Ylength] n = int(input()) X = [] Y = [] c = [[None]*1001 for i in range(1001)] for i in range(n): X.append(input()) Y.append(input()) for i in range(n): # print(i) print(lcs(X[i],Y[i])) c = [[None]*1001 for i in range(1001)]
s669254184
p02235
u494314211
1479030339
Python
Python3
py
Runtime Error
0
0
602
n=int(input()) al=[] bl=[] for i in range(n): al.append(list(input())) bl.append(list(input())) for i in range(n): a=al.pop(0) b=bl.pop(0) dp=[[0 for i in range(len(b))] for j in range(len(a))] if a[0]==b[0]: dp[0][0]=1 for i in range(1,len(a)): if a[i]=b[0]: dp[i][0]=1 else: dp[i][0]=dp[i-1][0] for i in range(1,len(b)): if a[0]=b[i]: dp[0][i]=1 else: dp[0][i]=dp[0][i-1] for i in range(1, len(a)): for j in range(1, len(b)): if a[i]!=b[j]: dp[i][j]=max(dp[i-1][j-1],dp[i-1][j],dp[i][j-1]) else: dp[i][j]=dp[i-1][j-1]+1 print(dp[len(a)-1][len(b)-1])
s309547543
p02235
u494314211
1479031142
Python
Python3
py
Runtime Error
0
0
567
n=int(input()) l=[] for i in range(n): a=al.list(input()) b=bl.list(input()) dp=[[0 for i in range(len(b))] for j in range(len(a))] if a[0]==b[0]: dp[0][0]=1 for i in range(1,len(a)): if a[i]==b[0]: dp[i][0]=1 else: dp[i][0]=dp[i-1][0] for i in range(1,len(b)): if a[0]==b[i]: dp[0][i]=1 else: dp[0][i]=dp[0][i-1] for i in range(1, len(a)): for j in range(1, len(b)): if a[i]==b[j]: dp[i][j]=dp[i-1][j-1]+1 else: dp[i][j]=max(dp[i-1][j-1],dp[i-1][j],dp[i][j-1]) l.append(dp[len(a)-1][len(b)-1]) for i in l: print(l)
s241834413
p02235
u811733736
1481030028
Python
Python3
py
Runtime Error
0
0
776
def calc_lcs(X, Y): m = len(X) n = len(Y) c = [[0 for _ in range(n)] for i in range(m)] for i in range(m): for j in range(n): if X[i] == Y[j]: c[i][j] = c[i-1][j-1] + 1 elif c[i-j][j] >= c[j][j-1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j -1] max_lcs = 0 for row in c: temp = max(row) if temp > max_lcs: max_lcs = temp return max_lcs if __name__ == '__main__': # ??????????????\??? num = int(input()) # X = 'abcbdab' # Y = 'bdcaba' for _ in range(num): X = input() Y = input() # ??????????????? result = calc_lcs(X, Y) # ???????????¨??? print(result)
s840180487
p02235
u022407960
1481338306
Python
Python3
py
Runtime Error
60
7744
1231
#!/usr/bin/env python # -*- coding: utf-8 -*- """ input: 3 abcbdab bdcaba abc abc abc bc output: 4 3 2 """ import sys def lcs(A, B): m, n = len(A), len(B) count_list = tuple([[0] * (n + 1) for _ in range(m + 1)]) for i in range(1, m + 1): for j in range(1, n + 1): if A[i - 1] == B[j - 1]: count_list[i][j] = count_list[i - 1][j - 1] + 1 else: count_list[i][j] = max(count_list[i - 1][j], count_list[i][j - 1]) return count_list[m][n] def lcs_recursive(A, B, m, n): if m == 0 or n == 0: return 0 elif A[m - 1] == B[n - 1]: return 1 + lcs_recursive(A, B, m - 1, n - 1) else: return max(lcs_recursive(A, B, m, n - 1), lcs_recursive(A, B, m - 1, n)) if __name__ == '__main__': _input = sys.stdin.readlines() pair_num = int(_input[0]) word_list = _input[1:] # assert len(word_list) == 2 * pair_num # for k in range(0, len(word_list), 2): # print(lcs(word_list[k].strip(), word_list[k + 1].strip())) for pair in zip(word_list[::2], word_list[1::2]): w1, w2 = map(lambda x: x.strip(), pair) l1, l2 = len(w1), len(w2) print(lcs_recursive(w1, w2, l1, l2))
s583914733
p02235
u564398841
1485062264
Python
Python3
py
Runtime Error
0
0
824
from typing import List def make_lcs(lhs, rhs): pass class stub(): def __init__(self): self.fin = open('task.txt') def stub_input(self): return self.fin.readline() # _stub = stub() # input = _stub.stub_input def make_lcs(lhs: List[str], rhs: List[str]): c = [[0 for _ in range(len(rhs) + 1)] for _ in range(len(lhs) + 1)] for l_i in range(len(lhs)): for r_i in range(len(rhs)): if lhs[l_i] == rhs[r_i]: c[l_i + 1][r_i + 1] = c[l_i][r_i] + 1 else: c[l_i + 1][r_i + 1] = max(c[l_i][r_i + 1], c[l_i + 1][r_i]) print(c[-1][-1]) if __name__ == '__main__': n = int(input()) for _ in range(n): lhs = [i for i in input().rstrip()] rhs = [i for i in input().rstrip()] make_lcs(lhs, rhs)
s082236259
p02235
u564398841
1485063729
Python
Python3
py
Runtime Error
0
0
641
import itertools import time c = [[0 for _ in range(1001)] for _ in range(1001)] def make_lcs(lhs, rhs): llen = len(lhs) rlen = len(rhs) for l_i, r_i in itertools.product(range(llen), range(rlen)): c[l_i + 1][r_i + 1] = max(c[l_i][r_i + 1], c[l_i + 1][r_i]) if lhs[l_i] != rhs[r_i] else c[l_i][r_i] + 1 print(c[llen][rlen]) if __name__ == '__main__': # start = time.time() n = int(input()) for _ in range(n): lhs = [i for i in input().rstrip()] rhs = [i for i in input().rstrip()] make_lcs(lhs, rhs) end = time.time() - start # print('elapsed time: {}'.format(end))
s316306195
p02235
u564398841
1485065922
Python
Python3
py
Runtime Error
0
0
634
import itertools import numpy import time c = [[0]*1001 for _ in range(1001)] def make_lcs(lhs, rhs): llen = len(lhs) rlen = len(rhs) for l_i, r_i in itertools.product(range(llen), range(rlen)): c[l_i + 1][r_i + 1] = max(c[l_i][r_i + 1], c[l_i + 1][r_i]) if lhs[l_i] != rhs[r_i] else c[l_i][r_i] + 1 print(c[llen][rlen]) if __name__ == '__main__': start = time.time() n = int(input()) for _ in range(n): lhs = [i for i in input().rstrip()] rhs = [i for i in input().rstrip()] make_lcs(lhs, rhs) end = time.time() - start print('elapsed time: {}'.format(end))
s252591615
p02235
u923668099
1485591460
Python
Python3
py
Runtime Error
50
7624
319
def lcs_rec(i, j): if i == 0 or j == 0: return 0 if X[i - 1] == Y[j - 1]: return lcs_rec(i - 1, j - 1) + 1 else: return max(lcs_rec(i - 1, j), lcs_rec(i, j - 1)) q = int(input()) for i in range(q): X = input() Y = input() ans = lcs_rec(len(X), len(Y)) print(ans)
s188592948
p02235
u923668099
1485591836
Python
Python3
py
Runtime Error
60
8260
447
import sys from functools import lru_cache sys.setrecursionlimit(3 * 1000) @lru_cache(maxsize=None) def lcs_rec(i, j): if i == 0 or j == 0: return 0 if X[i - 1] == Y[j - 1]: return lcs_rec(i - 1, j - 1) + 1 else: return max(lcs_rec(i - 1, j), lcs_rec(i, j - 1)) q = int(input()) for i in range(q): X = input() Y = input() ans = lcs_rec(len(X), len(Y)) lcs_rec.cache_clear() print(ans)
s935849667
p02235
u564398841
1486831875
Python
Python3
py
Runtime Error
50
15572
699
q = int(input().rstrip()) data_set = [[[i for i in input().rstrip()], [i for i in input().rstrip()]] for i in range(q)] common_list = [[0] * 1000 for i in range(1000)] def lcs(X: list, Y: list): global common_list m, n = len(X), len(Y) for i in range(1, m + 1): for k in range(1, n + 1): if X[i - 1] == Y[k - 1]: common_list[i][k] = common_list[i - 1][k - 1] + 1 elif common_list[i - 1][k] >= common_list[i][k - 1]: common_list[i][k] = common_list[i - 1][k] else: common_list[i][k] = common_list[i][k - 1] return common_list[m][n] for l, r in data_set: print(lcs(l, r))
s270764461
p02235
u831244171
1489502623
Python
Python3
py
Runtime Error
0
0
427
q = int(input()) def lcss(x,y): lcs = [0]*(len(x)+1) for i in range(len(y)): w1 = y[i] lcs_2 = lcs[:] for j in range(len(x)): if x[j] == w1: lcs[j+1] = lcs_2[j] + 1 elif lcs[j+1] < lcs[j]: lcs[j+1] = lcs[j] return lcs[-1] ret = [] for i in range(q): x = input() y = input() ret.append(lcss()) print(*ret,sep= "\n")
s791217863
p02235
u089830331
1494747769
Python
Python3
py
Runtime Error
70
7708
351
def get_longest_count(X, Y): count = 0 while len(X) > 0 and len(Y) > 0: if X[-1] != Y[-1]: return count + max(get_longest_count(X[:-1], Y), get_longest_count(X, Y[:-1])) else: X = X[:-1] Y = Y[:-1] count += 1 return count for i in range(int(input())): X = input() Y = input() print(get_longest_count(X, Y))
s022259259
p02235
u370086573
1495557110
Python
Python3
py
Runtime Error
0
0
925
def lcs_len(x, y): indices = [0] for y_i in y: t_index = 0 for i, index in enumerate(indices, 1): c_index = x.find(y_i, t_index) + 1 if c_index: if i < len(indices): t_index = indices[i] indices[i] = min(c_index, t_index) else: indices.append(c_index) break print(len(indices) - 1) def answer(X, Y): m, n = len(X), len(Y) C = [[0] * (n + 1) for _ in range(m + 1)] for i in range(1, m + 1): for j in range(1, n + 1): if X[i - 1] == Y[j - 1]: C[i][j] = C[i-1][j-1] + 1 else: C[i][j] = max(C[i][j -1], C[i -1][j]) return C[m][n] if __name__ == '__main__': q = int(input()) for _ in range(q): X = list(input()) Y = list(input()) print(lcs_len(X, Y))
s409069119
p02235
u370086573
1495557193
Python
Python3
py
Runtime Error
0
0
918
def lcs_len(x, y): indices = [0] for y_i in y: t_index = 0 for i, index in enumerate(indices, 1): c_index = x.find(y_i, t_index) + 1 if c_index: if i < len(indices): t_index = indices[i] indices[i] = min(c_index, t_index) else: indices.append(c_index) break print(len(indices) - 1) def answer(X, Y): m, n = len(X), len(Y) C = [[0] * (n + 1) for _ in range(m + 1)] for i in range(1, m + 1): for j in range(1, n + 1): if X[i - 1] == Y[j - 1]: C[i][j] = C[i-1][j-1] + 1 else: C[i][j] = max(C[i][j -1], C[i -1][j]) return C[m][n] if __name__ == '__main__': q = int(input()) for _ in range(q): X = list(input()) Y = list(input()) lcs_len(X, Y)
s930525343
p02235
u370086573
1495557386
Python
Python3
py
Runtime Error
0
0
837
def lcs_better(X, Y): costs = [0] for c in Y: for i in range(len(costs) - 1, -1, -1): tmp = X.find(c, costs[i]) if tmp + 1: if i + 1 < len(costs): costs[i + 1] = min(costs[i + 1], tmp + 1) else: costs.append(tmp + 1) return len(costs) - 1 def answer(X, Y): m, n = len(X), len(Y) C = [[0] * (n + 1) for _ in range(m + 1)] for i in range(1, m + 1): for j in range(1, n + 1): if X[i - 1] == Y[j - 1]: C[i][j] = C[i-1][j-1] + 1 else: C[i][j] = max(C[i][j -1], C[i -1][j]) return C[m][n] if __name__ == '__main__': q = int(input()) for _ in range(q): X = list(input()) Y = list(input()) print(lcs_better(X, Y))
s130805893
p02235
u616085665
1502518193
Python
Python
py
Runtime Error
0
0
755
dp = [[0] * (1001) for i in xrange(1001)] def main(): ????????n = input() ????????for i in xrange(n): ????????????????X = raw_input() ????????????????Y = raw_input() ????????????????print lcs(X,Y) ?? def lcs(X,Y): ????????m = len(X) ????????n = len(Y) ????????for i in xrange(m): ????????????????for j in xrange(n): ????????????????????????if X[i] == Y[j]: ????????????????????????????????dp[i+1][j+1] = dp[i][j] + 1 ????????????????????????else: ????????????????????????????????if dp[i][j+1] >= dp[i+1][j]: ????????????????????????????????????????dp[i+1][j+1] = dp[i][j+1] ????????????????????????????????else: ????????????????????????????????????????dp[i+1][j+1] = dp[i+1][j] ????????return dp[m][n] ?????????? if __name__ == "__main__": ????????main()
s884873417
p02235
u616085665
1502518832
Python
Python
py
Runtime Error
0
0
753
dp = [[0] * 1001 for i in xrange(1001)] def main(): ????????n = input() ????????for i in xrange(n): ????????????????X = raw_input() ????????????????Y = raw_input() ????????????????print lcs(X,Y) ?? def lcs(X,Y): ????????m = len(X) ????????n = len(Y) ????????for i in xrange(m): ????????????????for j in xrange(n): ????????????????????????if X[i] == Y[j]: ????????????????????????????????dp[i+1][j+1] = dp[i][j] + 1 ????????????????????????else: ????????????????????????????????if dp[i][j+1] >= dp[i+1][j]: ????????????????????????????????????????dp[i+1][j+1] = dp[i][j+1] ????????????????????????????????else: ????????????????????????????????????????dp[i+1][j+1] = dp[i+1][j] ????????return dp[m][n] ?????????? if __name__ == "__main__": ????????main()
s094673066
p02235
u811733736
1502981000
Python
Python3
py
Runtime Error
4950
16632
870
def calc_lcs(X, Y): from array import array max_lcs = 0 m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y c = array('b', [0] * (1001 * 1001)) for i in range(1, m+1): for j in range(1, n+1): if X[i] == Y[j]: c[i*1001 + j] = c[(i-1)*1001 + j - 1] + 1 elif c[(i-1)*1001 + j] >= c[i*1001 + j - 1]: c[i*1001 + j] = c[(i-1)*1001 + j] else: c[i*1001 + j] = c[i*1001 + j - 1] max_lcs = max(max_lcs, c[i*1001 + j]) return max_lcs if __name__ == '__main__': # ??????????????\??? num = int(input()) # num = 1 for _ in range(num): X = input() Y = input() # X = 'abcbdab' # Y = 'bdcaba' # ??????????????? result = calc_lcs(X, Y) # ???????????¨??? print(result)
s824499453
p02235
u811733736
1502981923
Python
Python3
py
Runtime Error
0
0
867
def calc_lcs(X, Y): from array import array m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y c = array('I', [0] * (1001 * 1001)) for i in range(1, m+1): for j in range(1, n+1): if X[i] == Y[j]: c[i*1001 + j] = c[(i-1)*1001 + j - 1] + 1 elif c[(i-1)*1001 + j] >= c[i*1001 + j - 1]: c[i*1001 + j] = c[(i-1)*1001 + j] else: c[i*1001 + j] = c[i*1001 + j - 1] return max(c) if __name__ == '__main__': # ??????????????\??? # num = int(input()) f = open('input.txt') num = int(f.readline()) for _ in range(num): # X = input() # Y = input() X = f.readline().strip() Y = f.readline().strip() # ??????????????? result = calc_lcs(X, Y) # ???????????¨??? print(result)
s251720380
p02235
u811733736
1502982676
Python
Python3
py
Runtime Error
0
0
858
def calc_lcs2(X, Y): max_lcs = 0 m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y c = [[0]*(m+1) for i in range(n+1)] for i in range(1, m+1): for j in range(1, n+1): if X[i] == Y[j]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] for row in c: max_lcs = max(row) return max_lcs if __name__ == '__main__': # ??????????????\??? num = int(input()) # f = open('input.txt') # num = int(f.readline()) for _ in range(num): X = input() Y = input() # X = f.readline().strip() # Y = f.readline().strip() # ??????????????? result = calc_lcs2(X, Y) # ???????????¨??? print(result)
s430767003
p02235
u811733736
1502991589
Python
Python3
py
Runtime Error
0
0
3420
def prep_array(X, Y): """ ??????0???2?¬???????????????¨??????????????????????????\????????????????????§??????????????????????¨?(1000+1) """ c = [[0]*1001 for _ in range(1000+1)] return c def check_max(array): """ 2?¬????????????????????????§??????????????? """ max_lcs = 0 for row in array: temp_max = max(row) if temp_max > max_lcs: max_lcs = temp_max return max_lcs def calc_lcs4(X, Y, c): """ X[i]???for j?????????????????????????????°????????????????????§??? 4/5 ?????????????????????????????¨????????????????????????????????°??§6.5?§? """ X = ' ' + X Y = ' ' + Y m = len(X) n = len(Y) max_lcs = 0 pre_row = c[0] for i in range(1, m): row = c[i] XX = X[i] for j, YY in enumerate(Y): if XX == YY: row[j] = pre_row[j - 1] + 1 if row[j] > max_lcs: max_lcs = row[j] elif pre_row[j] >= row[j - 1]: row[j]= pre_row[j] else: row[j] = row[j - 1] pre_row = row return max_lcs def calc_lcs3(X, Y, c): """ X[i]???for j?????????????????????????????°????????????????????§??? 4/5 ?????????????????????????????¨????????????????????????????????°??§7.1?§? """ m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y pre_row = c[0] for i in range(1, m+1): row = c[i] XX = X[i] for j in range(1, n+1): if XX == Y[j]: row[j] = pre_row[j - 1] + 1 elif pre_row[j] >= row[j - 1]: row[j] = pre_row[j] else: row[j] = row[j - 1] pre_row = row return check_max(c) def calc_lcs2(X, Y, c): """ c[i][j]????????¢????????????????????????????????§?????????????????¨?????????????????°??????????????????????????£??????????????§??? 4/5 ?????????????????????????????¨????????????????????????????????°??§8.2?§? """ m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y pre_row = c[0] for i in range(1, m+1): row = c[i] for j in range(1, n+1): if X[i] == Y[j]: row[j] = pre_row[j - 1] + 1 elif pre_row[j] >= row[j - 1]: row[j] = pre_row[j] else: row[j] = row[j - 1] pre_row = row return check_max(c) def calc_lcs(X, Y, c): """ ??????????????¢?????´????????????????????????????£????????????? 4/5 ?????????????????????????????¨????????????????????????????????°??§12.5?§? """ m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y for i in range(1, m+1): for j in range(1, n+1): if X[i] == Y[j]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] return check_max(c) if __name__ == '__main__': # ??????????????\??? num = int(input()) # f = open('input.txt') # num = int(f.readline()) for _ in range(num): X = input() Y = input() # X = f.readline().strip() ??????# Y = f.readline().strip() # ??????????????? result = calc_lcs4(X, Y, prep_array(X, Y)) # ???????????¨??? print(result)
s659463790
p02235
u811733736
1503041916
Python
Python3
py
Runtime Error
0
0
488
def lcs(): A = raw_input() B = raw_input() m = len(A) n = len(B) dp = [[0 for i in range(n + 1)] for j in range(m + 1)] maxl = 0 for i in range(1, m + 1): for j in range(1, n + 1): if A[i - 1] == B[j - 1]: dp[i][j] = dp[i - 1][j - 1] + 1 else: dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) maxl = max(maxl, dp[i][j]) return maxl n = input() for _ in range(n): print lcs()
s917391185
p02235
u811733736
1503041970
Python
Python3
py
Runtime Error
0
0
481
def lcs(): A = input() B = input() m = len(A) n = len(B) dp = [[0 for i in range(n + 1)] for j in range(m + 1)] maxl = 0 for i in range(1, m + 1): for j in range(1, n + 1): if A[i - 1] == B[j - 1]: dp[i][j] = dp[i - 1][j - 1] + 1 else: dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) maxl = max(maxl, dp[i][j]) return maxl n = input() for _ in range(n): print(lcs())
s219554203
p02235
u193453446
1504514204
Python
Python3
py
Runtime Error
0
0
634
def main(): num = int(input()) for i in range(num): X = " " + input() Y = " " + input() lx = len(X) ly = len(Y) max = 0 XY = [[0] * ly for i in range(lx)] for j in range(1,lx): for k in range(1,ly): if X[j] == Y[k]: XY[j][k] = XY[j-1][k-1] + 1 elif XY[j-1][k] > XY[j][k-1]: XY[j][k] = XY[j-1][k] else: XY[j][k] = XY[j][k-1] if max < XY[j][k]: max = XY[j][k] print(max) f __name__ == '__main__': main()
s866563604
p02235
u811733736
1507948582
Python
Python3
py
Runtime Error
0
0
5901
# -*- coding: utf-8 -*- """ http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C ????????±?????¨?????? """ # 4/5??§Time Limit Exceeded 5.20s ????????????5s??\??????????????????????????? c = [] def prep_array(X, Y): global c """ ??????0???2?¬???????????????¨??????????????????????????\????????????????????§??????????????????????¨?(1000+1)??\???????????? """ # from array import array # c = [array('I', [0] * (len(X)+1)) for _ in range(len(Y)+1)] # array??§??¨??? c = [[0]*(len(X)+2) for _ in range(len(Y)+2)] # ???????????§??¨??? return c def check_max(array): """ 2?¬????????????????????????§??????????????? """ max_lcs = 0 for row in array: temp_max = max(row) if temp_max > max_lcs: max_lcs = temp_max return max_lcs def calc_lcs4(X, Y, c): """ Y[j]?????¢???????????????????????´ ?????????????????????????????°?????????????????????????????´ ????????±?????¨???????????¢??°?????§?¨????????????????????????´ 4/5 ?????????????????????????????¨?????????????????????????????°????????¨??????????????? 5.6?§? """ X = ' ' + X Y = ' ' + Y m = len(X) n = len(Y) max_lcs = 0 pre_row = c[0] for i in range(1, m): row = c[i] XX = X[i] for j, YY in enumerate(Y): if XX == YY: pr_j1 = pre_row[j - 1] row[j] = pr_j1 + 1 if pr_j1+1 > max_lcs: max_lcs = pr_j1 + 1 else: pr_j = pre_row[j] r_j1 = row[j-1] if pr_j >= r_j1: row[j] = pr_j else: row[j] = r_j1 pre_row = row return max_lcs def calc_lcs3(X, Y, c): """ X[i]???for j?????????????????????????????°(XX)????????????????????§??? 4/5 ?????????????????????????????¨?????????????????????????????°????????¨??????????????? 6.5?§? """ m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y pre_row = c[0] for i in range(1, m+1): row = c[i] XX = X[i] for j in range(1, n+1): if XX == Y[j]: row[j] = pre_row[j - 1] + 1 elif pre_row[j] >= row[j - 1]: row[j] = pre_row[j] else: row[j] = row[j - 1] pre_row = row return check_max(c) def calc_lcs2(X, Y, c): """ c[i][j]????????¢????????????????????????????????§???????????????(row)??¨?????????(pre_row)????????°??????????????????????????£??????????????§??? 4/5 ?????????????????????????????¨?????????????????????????????°????????¨??????????????? 7.5?§? """ m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y pre_row = c[0] for i in range(1, m+1): row = c[i] for j in range(1, n+1): if X[i] == Y[j]: row[j] = pre_row[j - 1] + 1 elif pre_row[j] >= row[j - 1]: row[j] = pre_row[j] else: row[j] = row[j - 1] pre_row = row return check_max(c) def calc_lcs1(X, Y): """ ?????????????????????array?????????????????¨???byte???????????¨????????¨????§??????????????????????????????????????????§?????¨???????????£?????????int???????????¨??? 4/5 ?????????????????????????????¨?????????????????????????????°????????¨??????????????? 18.5?§? """ from array import array m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y c = array('i', [0] * (1024 * 1024)) for i in range(1, m+1): for j in range(1, n+1): if X[i] == Y[j]: c[i*1024 + j] = c[(i-1)*1024 + j - 1] + 1 elif c[(i-1)*1024 + j] >= c[i*1024 + j - 1]: c[i*1024 + j] = c[(i-1)*1024 + j] else: c[i*1024 + j] = c[i*1024 + j - 1] return max(c) def calc_lcs1_1(X, Y): """ 4/5 ?????????????????????????????¨?????????????????????????????°????????¨??????????????? 7.1?§? """ from array import array X = ' ' + X Y = ' ' + Y m = len(X) n = len(Y) max_lcs = 0 C = [array('I', [0] * n) for _ in range(m)] pre_row = C[0] for i in range(1, m): row = C[i] XX = X[i] for j, YY in enumerate(Y[1:]): if XX == YY: pr_j1 = pre_row[j-1] row[j] = pr_j1 + 1 if row[j] > max_lcs: max_lcs = pr_j1 + 1 else: pr_j = pre_row[j] r_j1 = row[j-1] if pr_j >= r_j1: row[j] = pr_j else: row[j]= r_j1 pre_row = row return max_lcs def calc_lcs(X, Y, c): """ ??????????????¢?????´????????????(??????)????????????????£????????????? 4/5 ?????????????????????????????¨?????????????????????????????°????????¨??????????????? 11.3?§? ????????????????????¨????????????????????¢??°??§?¶?????????????????????§?????¢??°??????????????????????????????????????? """ m = len(X) n = len(Y) X = ' ' + X Y = ' ' + Y for i in range(1, m+1): for j in range(1, n+1): if X[i] == Y[j]: c[i][j] = c[i - 1][j - 1] + 1 elif c[i - 1][j] >= c[i][j - 1]: c[i][j] = c[i - 1][j] else: c[i][j] = c[i][j - 1] return check_max(c) if __name__ == '__main__': # ??????????????\??? num = int(input()) #f = open('input.txt') #num = int(f.readline()) for _ in range(num): X = input().strip() Y = input().strip() #X = f.readline().strip() #Y = f.readline().strip() # ??????????????? result = calc_lcs4(X, Y, prep_array(X, Y)) # ???????????¨??? print(result)