s_id string | p_id string | u_id string | date string | language string | original_language string | filename_ext string | status string | cpu_time string | memory string | code_size string | code string | error string | stdout string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s610388988 | p02271 | u318430977 | 1528641086 | Python | Python3 | py | Runtime Error | 9920 | 5612 | 516 | def solve(a, m):
if len(a) == 0:
if m == 0:
return True
else:
return False
else:
if solve(a[1:], m - a[0]):
return True
else:
return solve(a[1:], m)
n = int(input())
tmp = input().split()
a = []
for i in range(n):
a.append(int(tmp[i]))
q = int(input())
tmp = input().split()
m = []
for i in range(q):
m.append(int(tmp[i]))
for i in range(q):
if solve(a, m[i]):
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmpem26h1hc/tmp_e8riflq.py", line 13, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s879582169 | p02271 | u318430977 | 1528641359 | Python | Python3 | py | Runtime Error | 9910 | 5608 | 516 | def solve(a, m):
if len(a) == 0:
if m == 0:
return True
else:
return False
else:
if solve(a[1:], m - a[0]):
return True
else:
return solve(a[1:], m)
n = int(input())
tmp = input().split()
a = []
for i in range(n):
a.append(int(tmp[i]))
q = int(input())
tmp = input().split()
m = []
for i in range(q):
m.append(int(tmp[i]))
for i in range(q):
if solve(a, m[i]):
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmppwpx68sj/tmpawnowdms.py", line 13, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s409552701 | p02271 | u318430977 | 1528641693 | Python | Python3 | py | Runtime Error | 0 | 0 | 472 | def solve(a, m):
if m < 0 or m > sumA:
return False
if m == 0:
return True
if len(a) == 0:
return False
return solve(a[1:], m - a[0]) or solve(a[1:], m)
n = int(input())
tmp = input().split()
a = []
for i in range(n):
a.append(int(tmp[i]))
q = int(input())
tmp = input().split()
m = []
for i in range(q):
m.append(int(tmp[i]))
for i in range(q):
if solve(a, m[i]):
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmphktt93cd/tmp484csvlp.py", line 10, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s846456333 | p02271 | u559106458 | 1529249781 | Python | Python3 | py | Runtime Error | 0 | 0 | 289 | int n
list=[]
int q,M,i
n=input()
i=0
while i<n:
list.append(input())
i=i+1
q=input()
i=0
while i<q:
M=input()
if(solve(0,M)): print("yes\n")
else: print("no\n")
i=i+1
def solve(i,m)
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) || solve(i+1, m-list[i])
return res
| File "/tmp/tmp5goy06i8/tmpckot1csg.py", line 1
int n
^
SyntaxError: invalid syntax
| |
s702692571 | p02271 | u559106458 | 1529250781 | Python | Python3 | py | Runtime Error | 0 | 0 | 313 | int n
def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes\n")
else: print("no\n")
i=i+1
| File "/tmp/tmp8oq6lncx/tmpaciog_5o.py", line 1
int n
^
SyntaxError: invalid syntax
| |
s414054383 | p02271 | u559106458 | 1529250803 | Python | Python3 | py | Runtime Error | 0 | 0 | 309 | int n
def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes")
else: print("no")
i=i+1
| File "/tmp/tmplknik__f/tmpizl6qjwx.py", line 1
int n
^
SyntaxError: invalid syntax
| |
s628310495 | p02271 | u559106458 | 1529250821 | Python | Python3 | py | Runtime Error | 0 | 0 | 303 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes")
else: print("no")
i=i+1
| Traceback (most recent call last):
File "/tmp/tmps66rxvhp/tmpsuowxcbi.py", line 13, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s549553204 | p02271 | u559106458 | 1529250840 | Python | Python3 | py | Runtime Error | 0 | 0 | 307 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes\n")
else: print("no\n")
i=i+1
| Traceback (most recent call last):
File "/tmp/tmpjndkdtvx/tmp_t19das4.py", line 13, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s829915183 | p02271 | u559106458 | 1529250924 | Python | Python3 | py | Runtime Error | 0 | 0 | 303 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes")
else: print("no")
i=i+1
| Traceback (most recent call last):
File "/tmp/tmpi_7sx63m/tmp2mx61wms.py", line 13, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s529344973 | p02271 | u559106458 | 1529251014 | Python | Python3 | py | Runtime Error | 0 | 0 | 303 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes")
else: print("no")
i=i+1
| Traceback (most recent call last):
File "/tmp/tmpmah5nb1l/tmp7rg4nlxl.py", line 13, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s580531119 | p02271 | u559106458 | 1529251128 | Python | Python3 | py | Runtime Error | 0 | 0 | 312 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes")
else: print("no")
i=i+1
return 0
| File "/tmp/tmp76autw6l/tmpi21gun22.py", line 28
return 0
^^^^^^^^
SyntaxError: 'return' outside function
| |
s713613371 | p02271 | u559106458 | 1529251222 | Python | Python3 | py | Runtime Error | 0 | 0 | 302 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res = solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes")
else: print("no")
i=i+1
| Traceback (most recent call last):
File "/tmp/tmpnmz6xwml/tmprz97z33n.py", line 12, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s998714906 | p02271 | u559106458 | 1529251404 | Python | Python3 | py | Runtime Error | 0 | 0 | 302 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res=solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes");
else: print("no");
i=i+1
| Traceback (most recent call last):
File "/tmp/tmpu1r66972/tmpg5ogpgjh.py", line 12, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s943263844 | p02271 | u559106458 | 1529251421 | Python | Python | py | Runtime Error | 0 | 0 | 302 | def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res=solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes");
else: print("no");
i=i+1
| Traceback (most recent call last):
File "/tmp/tmpnqj08syr/tmp1ssv123_.py", line 12, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s454093777 | p02271 | u559106458 | 1529251490 | Python | Python3 | py | Runtime Error | 0 | 0 | 302 | n=0
list=[]
q=0
M=0
n=int(input())
i=0
while i<n:
list.append(input())
i=i+1
q=int(input())
def solve(i,m):
if(m==0):return 1
if(i>=n):return 0
res=solve(i+1,m) or solve(i+1, m-int(list[i]))
return res
i=0
while i<q:
M=int(input())
if(solve(0,M)): print("yes");
else: print("no");
i=i+1
| Traceback (most recent call last):
File "/tmp/tmp7ygsqo9z/tmpzzub5nr2.py", line 6, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s567378033 | p02271 | u971076135 | 1529371304 | Python | Python3 | py | Runtime Error | 480 | 5616 | 692 | def stdinput():
from sys import stdin
return stdin.readline().strip()
def main():
n = int(stdinput())
A = list(sorted(map(int, stdinput().split(' '))))
q = int(stdinput())
M = list(map(int, stdinput().split(' ')))
for m in M:
if check(m, A):
print('yes')
else:
print('no')
def check(m, A):
# print(f'{m}:{A}')
if m == 0:
return True
elif len(A) == 0:
return False
elif m > 0:
for i, a in enumerate(A):
if check(m-a, A[:i] + A[i+1:]):
return True
return False
if __name__ == '__main__':
main()
# import cProfile
# cProfile.run('main()')
| Traceback (most recent call last):
File "/tmp/tmp5_9lartd/tmpijnu0850.py", line 30, in <module>
main()
File "/tmp/tmp5_9lartd/tmpijnu0850.py", line 6, in main
n = int(stdinput())
^^^^^^^^^^^^^^^
ValueError: invalid literal for int() with base 10: ''
| |
s201741329 | p02271 | u971076135 | 1529371874 | Python | Python3 | py | Runtime Error | 11170 | 5620 | 710 | def stdinput():
from sys import stdin
return stdin.readline().strip()
def main():
n = int(stdinput())
A = list(sorted(map(int, stdinput().split(' '))))
q = int(stdinput())
M = list(map(int, stdinput().split(' ')))
for m in M:
if check(m, 0, A):
print('yes')
else:
print('no')
def check(m, a, A):
# print(f'{m}, {a}, {A}')
for i, next_a in enumerate(A):
this_a = a + next_a
if this_a == m:
return True
elif this_a < m:
if check(m, this_a, A[i+1:]):
return True
return False
if __name__ == '__main__':
main()
# import cProfile
# cProfile.run('main()')
| Traceback (most recent call last):
File "/tmp/tmpce5zjvip/tmptauhx2sc.py", line 29, in <module>
main()
File "/tmp/tmpce5zjvip/tmptauhx2sc.py", line 6, in main
n = int(stdinput())
^^^^^^^^^^^^^^^
ValueError: invalid literal for int() with base 10: ''
| |
s604205940 | p02271 | u971076135 | 1529372263 | Python | Python3 | py | Runtime Error | 11020 | 5620 | 756 | def stdinput():
from sys import stdin
return stdin.readline().strip()
def main():
n = int(stdinput())
A = list(sorted(map(int, stdinput().split(' ')), reverse=True))
q = int(stdinput())
M = list(map(int, stdinput().split(' ')))
for m in M:
if check(m, 0, list(filter(lambda a: a <= m, A))):
print('yes')
else:
print('no')
def check(m, a, A):
# print(f'{m}, {a}, {A}')
for i, next_a in enumerate(A):
this_a = a + next_a
if this_a == m:
return True
elif this_a < m:
if check(m, this_a, A[i+1:]):
return True
return False
if __name__ == '__main__':
main()
# import cProfile
# cProfile.run('main()')
| Traceback (most recent call last):
File "/tmp/tmpxhtwbb0z/tmp3gce749c.py", line 29, in <module>
main()
File "/tmp/tmpxhtwbb0z/tmp3gce749c.py", line 6, in main
n = int(stdinput())
^^^^^^^^^^^^^^^
ValueError: invalid literal for int() with base 10: ''
| |
s245806783 | p02271 | u007270338 | 1529972101 | Python | Python3 | py | Runtime Error | 0 | 0 | 621 | #coding:utf-8
import numpy as np
n = int(input())
A = list(map(int,input().split()))
q = int(input())
mList = list(map(int,input().split()))
dp = [[False for i in range(2000)] for j in range(20)]
dp = np.array(dp)
def solve(i,m):
if dp[i,m]:
return dp[i,m]
if m == 0:
dp[i,m] = True
elif i >= n or m < 0:
dp[i,m] = False
elif solve(i+1,m):
dp[i,m] = True
elif solve(i+1,m-A[i]):
dp[i,m] = True
else:
dp[i,m] = False
return dp[i,m]
for m in mList:
a = solve(0,m)
if a:
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmpd_wg_dyb/tmph_mldlmb.py", line 4, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s523155602 | p02271 | u007270338 | 1529972328 | Python | Python3 | py | Runtime Error | 15920 | 5948 | 593 | #coding:utf-8
n = int(input())
A = list(map(int,input().split()))
q = int(input())
mList = list(map(int,input().split()))
dp = [[False for i in range(2000)] for j in range(20)]
def solve(i,m):
if dp[i][m]:
return dp[i][m]
if m == 0:
dp[i][m] = True
elif i >= n or m < 0:
dp[i][m] = False
elif solve(i+1,m):
dp[i][m] = True
elif solve(i+1,m-A[i]):
dp[i][m] = True
else:
dp[i][m] = False
return dp[i][m]
for m in mList:
a = solve(0,m)
if a:
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmpno3ac0eu/tmprr10mkqt.py", line 3, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s499670596 | p02271 | u007270338 | 1529972797 | Python | Python3 | py | Runtime Error | 0 | 0 | 638 | #coding:utf-8
import numpy as np
n = int(input())
A = list(map(int,input().split()))
q = int(input())
mList = list(map(int,input().split()))
dp = [[False for i in range(2001)] for j in range(21)]
dp = np.array(dp)
def solve(i,m):
if dp[i,m]:
return dp[i,m]
if m < 0:
return
if m == 0:
dp[i,m] = True
elif i >= n:
dp[i,m] = False
elif solve(i+1,m):
dp[i,m] = True
elif solve(i+1,m-A[i]):
dp[i,m] = True
else:
dp[i,m] = False
return dp[i,m]
for m in mList:
a = solve(0,m)
if a:
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmp57o8d7m3/tmpaefzvrfq.py", line 4, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s781835347 | p02271 | u007270338 | 1529972860 | Python | Python3 | py | Runtime Error | 17450 | 5948 | 609 | #coding:utf-8
n = int(input())
A = list(map(int,input().split()))
q = int(input())
mList = list(map(int,input().split()))
dp = [[False for i in range(2001)] for j in range(21)]
def solve(i,m):
if dp[i][m]:
return dp[i][m]
if m < 0:
return
if m == 0:
dp[i][m] = True
elif i >= n:
dp[i][m] = False
elif solve(i+1,m):
dp[i][m] = True
elif solve(i+1,m-A[i]):
dp[i][m] = True
else:
dp[i][m] = False
return dp[i][m]
for m in mList:
a = solve(0,m)
if a:
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmps4641diy/tmpp923a066.py", line 3, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s925059048 | p02271 | u751769081 | 1530069618 | Python | Python3 | py | Runtime Error | 8190 | 5616 | 378 | def solve(i, m):
if m == 0:
return True
if i >= n:
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
n = int(input())
A = [int(e) for e in input().split()]
q = int(input())
M = [int(e) for e in input().split()]
for m in M:
result = solve(0, m)
if result == True:
print("yes")
else:
print("no")
| Traceback (most recent call last):
File "/tmp/tmpuyj5rnv0/tmpxo8c07z1.py", line 9, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s851318645 | p02271 | u424720817 | 1530236885 | Python | Python3 | py | Runtime Error | 12160 | 5608 | 423 | n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def main():
for number in m:
if solve(0, number):
print('yes')
else :
print('no')
def solve(i, m):
if m == 0:
return 1
if i >= n:
return 0
res = solve(i + 1, m) | solve(i + 1, m - a[i])
return res
if __name__ == '__main__':
main()
| Traceback (most recent call last):
File "/tmp/tmpvtldre55/tmp5xn0j3u5.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s184939598 | p02271 | u424720817 | 1530237296 | Python | Python3 | py | Runtime Error | 12860 | 5612 | 423 | n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def main():
for number in m:
if solve(0, number):
print('yes')
else :
print('no')
def solve(i, m):
if m == 0:
return 1
if i >= n:
return 0
res = solve(i + 1, m) | solve(i + 1, m - a[i])
return res
if __name__ == '__main__':
main()
| Traceback (most recent call last):
File "/tmp/tmpjl8ymj95/tmpx282qiew.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s355659689 | p02271 | u424720817 | 1530238802 | Python | Python3 | py | Runtime Error | 11850 | 5612 | 458 | n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def main():
for number in m:
if solve(n - 1, 0, number):
print('yes')
else :
print('no')
def solve(i, m, number):
if m == number:
return 1
if i < 0:
return 0
res = solve(i - 1, m, number) | solve(i - 1, m + a[i], number)
return res
if __name__ == '__main__':
main()
| Traceback (most recent call last):
File "/tmp/tmpbyx84n48/tmpo5v666cq.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s640630081 | p02271 | u424720817 | 1530241193 | Python | Python3 | py | Runtime Error | 7500 | 5612 | 424 | n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def main():
for number in m:
if solve(0, number):
print('yes')
else :
print('no')
def solve(i, m):
if m == 0:
return 1
if i >= n:
return 0
res = solve(i + 1, m) or solve(i + 1, m - a[i])
return res
if __name__ == '__main__':
main()
| Traceback (most recent call last):
File "/tmp/tmpf07x__ai/tmpmh1u4otn.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s277525725 | p02271 | u424720817 | 1530241318 | Python | Python3 | py | Runtime Error | 7930 | 5612 | 431 | n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def main():
for number in m:
if solve(0, number):
print('yes')
else :
print('no')
def solve(i, m):
if m == 0:
return True
if i >= n:
return False
res = solve(i + 1, m) or solve(i + 1, m - a[i])
return res
if __name__ == '__main__':
main()
| Traceback (most recent call last):
File "/tmp/tmph0gj4o42/tmpak3r5bdx.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s324991169 | p02271 | u298224238 | 1530242717 | Python | Python3 | py | Runtime Error | 0 | 0 | 33 | from numba.decorators import jit
| Traceback (most recent call last):
File "/tmp/tmpuae3eg9l/tmp9d1tpcl8.py", line 1, in <module>
from numba.decorators import jit
ModuleNotFoundError: No module named 'numba.decorators'
| |
s784418976 | p02271 | u300095814 | 1530249358 | Python | Python3 | py | Runtime Error | 7530 | 5608 | 321 | aN = int(input())
A = list(map(int, input().split()))
mN = int(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= aN:
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for m in M:
print("yes" if solve(0, m) else "no")
| Traceback (most recent call last):
File "/tmp/tmpu32g1nw8/tmphx4ngbg8.py", line 1, in <module>
aN = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s275545625 | p02271 | u300095814 | 1530249370 | Python | Python3 | py | Runtime Error | 7450 | 5608 | 321 | aN = int(input())
A = list(map(int, input().split()))
mN = int(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= aN:
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for m in M:
print("yes" if solve(0, m) else "no")
| Traceback (most recent call last):
File "/tmp/tmp5vjx03ib/tmpc7dkebgq.py", line 1, in <module>
aN = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s553562840 | p02271 | u300095814 | 1530249375 | Python | Python3 | py | Runtime Error | 7590 | 5612 | 321 | aN = int(input())
A = list(map(int, input().split()))
mN = int(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= aN:
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for m in M:
print("yes" if solve(0, m) else "no")
| Traceback (most recent call last):
File "/tmp/tmp7uao8s24/tmp3ze_j2gi.py", line 1, in <module>
aN = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s389190795 | p02271 | u657361950 | 1530622557 | Python | Python3 | py | Runtime Error | 14460 | 5612 | 524 |
def solve(arr, target):
return solve_rec(0, arr, target)
def solve_rec(i, arr, target):
if target == 0:
return True
if i >= len(arr):
return False
res1 = solve_rec(i + 1, arr, target)
res2 = solve_rec(i + 1, arr, target - arr[i])
if res1 == True or res2 == True:
return True
return False
n = int(input())
arr = list(map(int, input().split()))
q = int(input())
targets = list(map(int, input().split()))
for i in range(q):
res = solve(arr, targets[i])
if res == True:
print('yes')
else:
print('no')
| Traceback (most recent call last):
File "/tmp/tmp9v4ht8hu/tmpcjmxbidf.py", line 17, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s869467631 | p02271 | u657361950 | 1530622649 | Python | Python3 | py | Runtime Error | 14300 | 5612 | 524 |
def solve(arr, target):
return solve_rec(0, arr, target)
def solve_rec(i, arr, target):
if target == 0:
return True
if i >= len(arr):
return False
res1 = solve_rec(i + 1, arr, target)
res2 = solve_rec(i + 1, arr, target - arr[i])
if res1 == True or res2 == True:
return True
return False
n = int(input())
arr = list(map(int, input().split()))
q = int(input())
targets = list(map(int, input().split()))
for i in range(q):
res = solve(arr, targets[i])
if res == True:
print('yes')
else:
print('no')
| Traceback (most recent call last):
File "/tmp/tmp2qe1o1y9/tmp40bxs6bp.py", line 17, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s331037758 | p02271 | u657361950 | 1530622857 | Python | Python3 | py | Runtime Error | 0 | 0 | 481 |
def solve(arr, target):
return solve_rec(0, arr, target)
def solve_rec(i, arr, target):
if target == 0:
return True
if i >= len(arr):
return False
res1 = solve_rec(i + 1, arr, target)
res2 = solve_rec(i + 1, arr, target - arr[i]
return res1 or res2
n = int(input())
arr = list(map(int, input().split()))
q = int(input())
targets = list(map(int, input().split()))
for i in range(q):
res = solve(arr, targets[i])
if res == True:
print('yes')
else:
print('no')
| File "/tmp/tmp1j8h8j_1/tmp71730nn4.py", line 11
res2 = solve_rec(i + 1, arr, target - arr[i]
^
SyntaxError: '(' was never closed
| |
s651083107 | p02271 | u657361950 | 1530622923 | Python | Python3 | py | Runtime Error | 13110 | 5612 | 482 |
def solve(arr, target):
return solve_rec(0, arr, target)
def solve_rec(i, arr, target):
if target == 0:
return True
if i >= len(arr):
return False
res1 = solve_rec(i + 1, arr, target)
res2 = solve_rec(i + 1, arr, target - arr[i])
return res1 or res2
n = int(input())
arr = list(map(int, input().split()))
q = int(input())
targets = list(map(int, input().split()))
for i in range(q):
res = solve(arr, targets[i])
if res == True:
print('yes')
else:
print('no')
| Traceback (most recent call last):
File "/tmp/tmp2z3w1pms/tmp6ppybt03.py", line 14, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s544915570 | p02271 | u657361950 | 1530631862 | Python | Python3 | py | Runtime Error | 12620 | 5612 | 480 |
def solve(arr, target):
return solve_rec(0, arr, target)
def solve_rec(i, arr, target):
if target == 0:
return True
if i >= len(arr):
return False
res1 = solve_rec(i + 1, arr, target)
res2 = solve_rec(i + 1, arr, target - arr[i])
return res1 or res2
n = int(input())
arr = list(map(int, input().split()))
q = int(input())
targets = list(map(int, input().split()))
for i in range(q):
res = solve(arr, targets[i])
if res == True:
print('yes')
else:
print('no')
| Traceback (most recent call last):
File "/tmp/tmpzrh6lolq/tmpug_w1v9s.py", line 14, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s435861772 | p02271 | u782850731 | 1379936772 | Python | Python | py | Runtime Error | 20000 | 4256 | 507 | #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
def solve(a, al, m, i):
if m == 0:
return True
if m > 0 and i < al:
if solve(a, al, m-a[i], i+1) or solve(a, al, m, i+1):
return True
return False
stdin.readline()
a = [int(s) for s in stdin.readline().split()]
stdin.readline()
ms = [int(s) for s in stdin.readline().split()]
for m in ms:
if solve(a, len(a), m, 0):
print('yes')
else:
print('no') | ||
s980116631 | p02271 | u782850731 | 1379940524 | Python | Python | py | Runtime Error | 20000 | 4256 | 527 | #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
def solve(a, al, m, i):
if not m:
return True
if m > 0 and i < al:
if solve(a, al, m-a[i], i+1) or solve(a, al, m, i+1):
return True
return False
stdin.readline()
a = [int(s) for s in stdin.readline().split()]
a.sort(reverse=True)
stdin.readline()
ms = [int(s) for s in stdin.readline().split()]
for m in ms:
if solve(a, len(a), m, 0):
print('yes')
else:
print('no') | ||
s488515679 | p02271 | u140201022 | 1389737613 | Python | Python | py | Runtime Error | 0 | 0 | 644 | #!/usr/bin/env python
# -*- coding:utf-8 -*-
from __future__ import print_function,division
from itertools import combinations
import time
import sys
import io
import re
import math
start = time.clock()
i = 0
def enum_sum_numbers(sets, s_range, r):
for cmb in combinations(sets,r):
yield sum(cmb)
if r <=s_range:
for s in enum_sum_numbers(sets,s_range, r+1):
yield s
sys.stdin.readline()
a=[int(s) for s in sys.stdin.readline().split()]
sys.stdin.readline()
ms=[int(s) for s in sys.stdin.readline().split()]
sets={s for s in enum_sum_numbers(a,len(a)),1}
for m in ms:
print('yes' if m in sets else 'no') | File "/tmp/tmphgbeo0au/tmpqeuyrm7a.py", line 23
sets={s for s in enum_sum_numbers(a,len(a)),1}
^
SyntaxError: invalid syntax
| |
s753064949 | p02272 | u269568674 | 1530850640 | Python | Python3 | py | Runtime Error | 1400 | 27308 | 607 | cnt = 0
def merge(l, left, mid, right):
L = l[left:mid] + [1000000]
R = l[mid:right] + [1000000]
i = 0
j = 0
for k in range(left, right):
global cnt
cnt += 1
if L[i] <= R[j]:
l[k] = L[i]
i += 1
else:
l[k] = R[j]
j += 1
def merge_sort(l, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(l, left, mid)
merge_sort(l, mid, right)
merge(l, left, mid, right)
n = input()
l = list(map(int, input().split()))
merge_sort(l,0,len(l))
print(*l)
print(cnt)
| Traceback (most recent call last):
File "/tmp/tmpa2iows92/tmpu54_nafz.py", line 24, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s703329531 | p02272 | u269568674 | 1530850720 | Python | Python3 | py | Runtime Error | 30 | 5712 | 602 | cnt = 0
def merge(l, left, mid, right):
L = l[left:mid] + [10000]
R = l[mid:right] + [10000]
i = 0
j = 0
for k in range(left, right):
global cnt
cnt += 1
if L[i] <= R[j]:
l[k] = L[i]
i += 1
else:
l[k] = R[j]
j += 1
def merge_sort(l, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(l, left, mid)
merge_sort(l, mid, right)
merge(l, left, mid, right)
n = input()
l = list(map(int, input().split()))
merge_sort(l,0,len(l))
print(*l)
print(cnt)
| Traceback (most recent call last):
File "/tmp/tmp3xgp9rae/tmpxnleqfyq.py", line 24, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s722861454 | p02272 | u269568674 | 1530850746 | Python | Python3 | py | Runtime Error | 20 | 5716 | 602 | cnt = 0
def merge(l, left, mid, right):
L = l[left:mid] + [2**10]
R = l[mid:right] + [2**10]
i = 0
j = 0
for k in range(left, right):
global cnt
cnt += 1
if L[i] <= R[j]:
l[k] = L[i]
i += 1
else:
l[k] = R[j]
j += 1
def merge_sort(l, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(l, left, mid)
merge_sort(l, mid, right)
merge(l, left, mid, right)
n = input()
l = list(map(int, input().split()))
merge_sort(l,0,len(l))
print(*l)
print(cnt)
| Traceback (most recent call last):
File "/tmp/tmpivkh066i/tmpsfw3w8di.py", line 24, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s424928988 | p02272 | u269568674 | 1530850784 | Python | Python3 | py | Runtime Error | 0 | 0 | 614 | EXTRA 10000
cnt = 0
def merge(l, left, mid, right):
L = l[left:mid] + [EXTRA]
R = l[mid:right] + [EXTRA]
i = 0
j = 0
for k in range(left, right):
global cnt
cnt += 1
if L[i] <= R[j]:
l[k] = L[i]
i += 1
else:
l[k] = R[j]
j += 1
def merge_sort(l, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(l, left, mid)
merge_sort(l, mid, right)
merge(l, left, mid, right)
n = input()
l = list(map(int, input().split()))
merge_sort(l,0,len(l))
print(*l)
print(cnt)
| File "/tmp/tmpddmo866f/tmp1u3j_vt3.py", line 1
EXTRA 10000
^^^^^
SyntaxError: invalid syntax
| |
s424937375 | p02272 | u269568674 | 1530850812 | Python | Python3 | py | Runtime Error | 30 | 5716 | 616 | EXTRA = 10000
cnt = 0
def merge(l, left, mid, right):
L = l[left:mid] + [EXTRA]
R = l[mid:right] + [EXTRA]
i = 0
j = 0
for k in range(left, right):
global cnt
cnt += 1
if L[i] <= R[j]:
l[k] = L[i]
i += 1
else:
l[k] = R[j]
j += 1
def merge_sort(l, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(l, left, mid)
merge_sort(l, mid, right)
merge(l, left, mid, right)
n = input()
l = list(map(int, input().split()))
merge_sort(l,0,len(l))
print(*l)
print(cnt)
| Traceback (most recent call last):
File "/tmp/tmpzavi8h_z/tmp9lur5stj.py", line 25, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s020038592 | p02272 | u153665391 | 1532093991 | Python | Python3 | py | Runtime Error | 0 | 0 | 869 | N = int(input())
A = list(map(int, input().split()))
INFTY = 1000000001
cnt = [0]
def merge(left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0 for _ in range(n1+1)]
R = [0 for _ in range(n2+1)]
for i in range(n1):
L[i] = A[left+i]
for i in range(n2):
R[i] = A[mid+i]
L[n1] = INFTY
R[n2] = INFTY
i = 0
j = 0
for k in range(left, right):
cnt[0] += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_sort(left, right):
if left+1 < right:
mid = int((left+right) / 2)
merge_sort(left, mid)
merge_sort(mid, right)
print("left:{}, mid:{}, right:{}".format(left, mid, right))
merge(left, mid, right)
print(A)
merge_sort(0, N)
print(" ".join(A))
print(cnt[0])
| Traceback (most recent call last):
File "/tmp/tmp5ws2fe2f/tmp1_fcl1n9.py", line 1, in <module>
N = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s844799859 | p02272 | u125481461 | 1541129890 | Python | Python3 | py | Runtime Error | 0 | 0 | 992 | import sys
compare_counter = 0
array = [0 for x in range(500000)]
def merge(left, mid, right):
n_fore = mid - left
n_rear = right - mid
l_fore = array[left:left + n_fore]
l_fore.append(sys.maxsize)
l_rear = array[mid:mid + n_rear]
l_rear.append(sys.maxsize)
i = j = 0
global compare_counter
compare_counter += (right - left)
for k in range(left, right):
if l_fore[i] < l_rear[j]:
array[k] = l_fore[i]
i += 1
else:
array[k] = l_rear[j]
j += 1
def merge_sort(left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(left, mid)
merge_sort(mid, right)
merge(left, mid, right)
return
def main():
start = time.time()
n = int(input())
for idx, tmp in enumerate(input().split()):
array[idx] = int(tmp)
merge_sort(0, n)
print(" ".join(map(str, array[:n])))
print(compare_counter)
return
main()
| Traceback (most recent call last):
File "/tmp/tmp6jodf4_6/tmph2suppen.py", line 49, in <module>
main()
File "/tmp/tmp6jodf4_6/tmph2suppen.py", line 36, in main
start = time.time()
^^^^
NameError: name 'time' is not defined
| |
s216727958 | p02272 | u803657704 | 1545366666 | Python | Python3 | py | Runtime Error | 0 | 0 | 823 | cnt = 0
def merge(A, left, mid, right):
global cnt
#print("marge ",A,left,mid,right)
n1 = mid - left
n2 = right - mid
#L = [0] * (n1+1)
#R = [0] * (n2+1)
L = [0] * (n1+1)
R = [0] * (n2+1)
for i in range(int(n1)):
L[i] = A[left + i]
for i in range(int(n2)):
R[i] = A[mid + i]
L[n1] = 999999999
R[n2] = 999999999
i,j = 0
for k in range(left,right):
cnt+=1
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
def mergeSort(A, left, right):
#print("margeSort ",A,left,right)
if left+1 < right:
mid = int((left + right)/2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
S = list(map(int,input().split()))
mergeSort(S, 0, n)
S = map(str, S)
print(' '.join(S))
print(cnt)
| Traceback (most recent call last):
File "/tmp/tmp1ko7mm8h/tmpwukvxcgs.py", line 36, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s181456353 | p02272 | u357267874 | 1559046787 | Python | Python3 | py | Runtime Error | 1510 | 27412 | 923 | count = 0
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = A[left:mid]
R = A[mid:right]
# print('merge for', left, 'to', right)
L.append(1000000)
R.append(1000000)
# print('n1', n1)
# print('n2', n2)
# print('L', L)
# print('R', R)
i = 0
j = 0
C = []
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
# print(A)
def merge_sort(A, left, right):
# print(left, right)
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
merge_sort(A, 0, len(A))
# print('==========')
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpfashn9k_/tmpmmmypc9r.py", line 43, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s806256081 | p02272 | u357267874 | 1559051604 | Python | Python3 | py | Runtime Error | 1430 | 27408 | 923 | count = 0
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = A[left:mid]
R = A[mid:right]
# print('merge for', left, 'to', right)
L.append(1000000)
R.append(1000000)
# print('n1', n1)
# print('n2', n2)
# print('L', L)
# print('R', R)
i = 0
j = 0
C = []
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
# print(A)
def merge_sort(A, left, right):
# print(left, right)
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
merge_sort(A, 0, len(A))
# print('==========')
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmp5n0x3jgm/tmpha7hpsaw.py", line 43, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s264607413 | p02272 | u357267874 | 1559051962 | Python | Python3 | py | Runtime Error | 1370 | 27404 | 669 | def merge(A, left, mid, right):
L = A[left:mid]
R = A[mid:right]
L.append(1000000)
R.append(1000000)
i = 0
j = 0
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
merge_sort(A, 0, len(A))
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpkgg7gfxl/tmpl413ylrn.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s859979945 | p02272 | u357267874 | 1559052000 | Python | Python3 | py | Runtime Error | 1470 | 27560 | 697 | def merge(A, left, mid, right):
L = A[left:mid] + [1000000]
R = A[mid:right] + [1000000]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
merge_sort(A, 0, len(A))
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpjgd4njz7/tmpjng07irf.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s500133784 | p02272 | u357267874 | 1559052069 | Python | Python3 | py | Runtime Error | 0 | 0 | 1031 | # def merge(A, left, mid, right):
# L = A[left:mid] + [1000000]
# R = A[mid:right] + [1000000]
# # L.append(1000000)
# # R.append(1000000)
# i = 0
# j = 0
# global count
# for k in range(left, right):
# count += 1
# if L[i] <= R[j]:
# A[k] = L[i]
# i += 1
# else:
# A[k] = R[j]
# j += 1
def merge(A, left, mid, right):
global count
inf = 10 ** 9
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
merge_sort(A, 0, len(A))
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmph8sen_u2/tmp2e32ifv1.py", line 43, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s115045392 | p02272 | u357267874 | 1559052470 | Python | Python3 | py | Runtime Error | 1370 | 27564 | 1084 | def merge(A, left, mid, right):
L = A[left:mid] + [1000000]
R = A[mid:right] + [1000000]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
# def merge(A, left, mid, right):
# global count
# inf = 10 ** 9
# L = A[left:mid] + [inf]
# R = A[mid:right] + [inf]
# i = 0
# j = 0
# for k in range(left, right):
# count += 1
# # print(L)
# # print(R)
# if L[i] <= R[j]:
# A[k] = L[i]
# i += 1
# else:
# A[k] = R[j]
# j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
mergeSort(A, 0, n)
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpabdav5na/tmpxd2xx2xc.py", line 46, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s160075462 | p02272 | u357267874 | 1559052579 | Python | Python3 | py | Runtime Error | 1370 | 27572 | 1067 | def merge_jibun(A, left, mid, right):
L = A[left:mid] + [1000000]
R = A[mid:right] + [1000000]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_hoka(A, left, mid, right):
global count
inf = 10 ** 9
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
for k in range(left, right):
count += 1
# print(L)
# print(R)
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge_jibun(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
mergeSort(A, 0, n)
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpou6z4r7b/tmpwdy_5bn6.py", line 46, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s202319793 | p02272 | u357267874 | 1559052685 | Python | Python3 | py | Runtime Error | 1360 | 27572 | 1109 | def merge_jibun(A, left, mid, right):
L = A[left:mid] + [1000000]
R = A[mid:right] + [1000000]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
global count
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_hoka(A, left, mid, right):
global count
inf = 10 ** 9
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
for k in range(left, right):
count += 1
# print(L)
# print(R)
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge_jibun(A, left, mid, right)
# merge_hoka(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
mergeSort(A, 0, n)
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmp_pgwj5qo/tmp9zvnwrh_.py", line 47, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s486546845 | p02272 | u357267874 | 1559052730 | Python | Python3 | py | Runtime Error | 1350 | 27576 | 1114 | def merge_jibun(A, left, mid, right):
global count
L = A[left:mid] + [1000000]
R = A[mid:right] + [1000000]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_hoka(A, left, mid, right):
global count
inf = 10 ** 9
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
for k in range(left, right):
count += 1
# print(L)
# print(R)
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge_jibun(A, left, mid, right)
# merge_hoka(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
mergeSort(A, 0, n)
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmp0x_a7llg/tmphxbbl_3u.py", line 48, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s213356873 | p02272 | u357267874 | 1559052772 | Python | Python3 | py | Runtime Error | 1410 | 27568 | 1114 | def merge_jibun(A, left, mid, right):
global count
L = A[left:mid] + [1000000]
R = A[mid:right] + [1000000]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_hoka(A, left, mid, right):
global count
inf = 10 ** 9
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
for k in range(left, right):
count += 1
# print(L)
# print(R)
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge_jibun(A, left, mid, right)
# merge_hoka(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
mergeSort(A, 0, n)
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmp3vdmnazj/tmp99d2trcj.py", line 48, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s746452414 | p02272 | u357267874 | 1559052911 | Python | Python3 | py | Runtime Error | 30 | 5628 | 1134 | def merge_jibun(A, left, mid, right):
global count
# inf = 10 ** 9
L = A[left:mid] + [10 ** 4]
R = A[mid:right] + [10 ** 4]
# L.append(1000000)
# R.append(1000000)
i = 0
j = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_hoka(A, left, mid, right):
global count
inf = 10 ** 9
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
for k in range(left, right):
count += 1
# print(L)
# print(R)
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge_jibun(A, left, mid, right)
# merge_hoka(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
mergeSort(A, 0, n)
print(' '.join(list(map(str, A))))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpthqo26_r/tmpknhc1hli.py", line 49, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s262543685 | p02272 | u604774382 | 1438252791 | Python | Python3 | py | Runtime Error | 0 | 0 | 649 | def merge( tS, left, mid, right ):
global cnt
n1 = mid - left;
n2 = right - mid;
tL = tS[ left : mid ];
tR = tS[ mid : right ];
tL.append( 1000000001 )
tR.append( 1000000001 )
i = j = 0
for k in range( left, right ):
cnt += 1
if tL[i] <= tR[j]:
tS[k] = tL[i]
i += 1
else:
tS[k] = tR[j]
j += 1
def mergeSort( tS, left, right ):
if left+1 < right:
mid = ( left+right )/2
mergeSort( tS, left, mid )
mergeSort( tS, mid, right )
merge( tS, left, mid, right )
n = int( input() )
arrS = [ int( val ) for val in input().split( ' ' ) ]
cnt = 0
mergeSort( arrS, 0, n )
print( " ".join( map( str, arrS ) ) )
print( cnt ) | Traceback (most recent call last):
File "/tmp/tmpgsvo6hl8/tmptlgbg8y4.py", line 27, in <module>
n = int( input() )
^^^^^^^
EOFError: EOF when reading a line
| |
s708868601 | p02272 | u885889402 | 1442377786 | Python | Python3 | py | Runtime Error | 2190 | 30484 | 762 | m=0
def merge(a,left,mid,right):
n1=mid-left
n2=right-mid
el=list(range(0,n1+1))
ar=list(range(0,n2+1))
for i in range(n1):
el[i]=a[left+i]
for i in range(n2):
ar[i]=a[mid+i]
el[n1]=20*10000
ar[n2]=20*10000
i=0
j=0
for k in range(left,right):
global m
m+=1
if(el[i] <= ar[j]):
a[k] = el[i]
i=i+1
else:
a[k]=ar[j]
j=j+1
def merge_sort(a,left,right):
if(left+1<right):
mid=(left+right)//2
merge_sort(a,left,mid)
merge_sort(a,mid,right)
merge(a,left,mid,right)
a=[]
n=int(input())
s=input()
a=list(map(int,s.split()))
merge_sort(a,0,n)
a=map(str,a)
print(" ".join(list(a)))
print(m)
| Traceback (most recent call last):
File "/tmp/tmpq8gww21n/tmpsz_6c2o0.py", line 33, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s130281519 | p02272 | u885889402 | 1442380213 | Python | Python | py | Runtime Error | 0 | 0 | 845 | m=0
def merge(a,left,mid,right):
n1=mid-left
n2=right-mid
el=range(0,n1+1)
ar=range(0,n2+1)
for i in range(n1):
el[i]=a[left+i]
for i in range(n2):
ar[i]=a[mid+i]
el[n1]=float("inf")
ar[n2]=float("inf")
i=0
j=0
for k in range(left,right):
global m
m+=1
if(el[i] <= ar[j]):
a[k] = el[i]
i=i+1
else:
a[k]=ar[j]
j=j+1
def merge_sort(a,left,right):
if(left+1<right):
mid=(left+right)//2
merge_sort(a,left,mid)
merge_sort(a,mid,right)
merge(a,left,mid,right)
else:
if(a[left]>a[right-1]):
a[left],a[right-1]=a[right],a[left]
n=int(input())
s=input()
a=list(map(int,s.split()))
merge_sort(a,0,n)
a=map(str,a)
print(" ".join(list(a)))
print(m)
| Traceback (most recent call last):
File "/tmp/tmpg1veut_f/tmpn2sgzbhs.py", line 37, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s735365731 | p02272 | u731976921 | 1442381009 | Python | Python3 | py | Runtime Error | 0 | 0 | 757 | INFTY = 10 ** 10
def merge(A, left, mid, right):
global count
n1 = mid - left;
n2 = right - mid;
L = []
R = []
L = A[left:left+n1]
R = A[mid:mid+n2]
L.append(INFTY)
R.append(INFTY)
i = 0
j = 0
for k in range(left, right):
count = count + 1
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
def mergeSort(A, left, right):
if left+1 < right:
mid = int((left + right)/2);
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
import sys
n = sys.stdin.readline()
for line in sys.stdin:
items = line.strip().split()
items = [ int(x) for x in items ]
mergeSort(items, 0, len(items))
print(" ".join(map(str, items)))
print(count) | ||
s251447322 | p02272 | u253463900 | 1442381356 | Python | Python3 | py | Runtime Error | 0 | 0 | 924 | count = 0
def marge(A,left,mid,right):
global count
n1 = mid -left
n2 = right -mid
L = []
R = []
j=0
for i in range(left,n1+left):
L[j]=A[i]
j += 1
L[j+1] = float("inf")
j=0
for i in range(mid,n2+mid):
R[j]=A[i]
j += 1
R[j+1] = float("inf")
'''
L.append(float("inf"))
R.append(float("inf"))
'''
r_id,l_id = 0,0
for k in range(left,right):
count += 1
if(L[l_id] <= R[r_id]):
A[k] = L[l_id]
l_id += 1
else:
A[k] = R[r_id]
r_id += 1
def margeSort(A,left,right):
if left+1 < right:
mid = int((left+right)/2)
margeSort(A,left,mid)
margeSort(A,mid,right)
marge(A,left,mid,right)
n = int(input())
s = input()
A = []
A = list(map(int,s.split()))
margeSort(A,0,n)
A_str = map(str,A)
print(" ".join(list(A_str)))
print(count) | File "/tmp/tmpj0f9qy9a/tmpu_rl8mhh.py", line 26
r_id,l_id = 0,0
IndentationError: unexpected indent
| |
s787878150 | p02272 | u197445199 | 1442382284 | Python | Python | py | Runtime Error | 0 | 0 | 966 | N = int(raw_input())
count = 0
A_str = raw_input().split()
A = map(int, A_str)
def merge(left, right):
global count
sorted_list = []
l_index = 0
r_index = 0
while l_index < len(left) and r_index < len(right):
count += 1
if left[l_index] <= right[r_index]:
sorted_list.append(left[l_index])
l_index += 1
else:
sorted_list.append(right[r_index])
r_index += 1
if len(left) != l_index:
sorted_list.extend(left[l_index:])
count += len(left[l_index:])
if len(right) != r_index:
sorted_list.extend(right[r_index:])
count += len(right[r_index:])
return sorted_list
def mergeSort(A):
if len(A) <= 1:
return A
mid = len(A) // 2
left = A[:mid]
right = A[mid:]
left = mergeSort(left)
right = mergeSort(right)
return list(merge(left, right))
print ' '.join(map(str, mergeSort(A)))print count | File "/tmp/tmpuqjh94l5/tmp29ml7uyf.py", line 45
print ' '.join(map(str, mergeSort(A)))print count
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s578023582 | p02272 | u197445199 | 1442382304 | Python | Python | py | Runtime Error | 0 | 0 | 978 | N = int(raw_input())
count = 0
A_str = raw_input().split()
A = map(int, A_str)
def merge(left, right):
global count
sorted_list = []
l_index = 0
r_index = 0
while l_index < len(left) and r_index < len(right):
count += 1
if left[l_index] <= right[r_index]:
sorted_list.append(left[l_index])
l_index += 1
else:
sorted_list.append(right[r_index])
r_index += 1
if len(left) != l_index:
sorted_list.extend(left[l_index:])
count += len(left[l_index:])
if len(right) != r_index:
sorted_list.extend(right[r_index:])
count += len(right[r_index:])
return sorted_list
def mergeSort(A):
if len(A) <= 1:
return A
mid = len(A) // 2
left = A[:mid]
right = A[mid:]
left = mergeSort(left)
right = mergeSort(right)
return list(merge(left, right))
print ' '.join(map(str, mergeSort(A)))print count
print count | File "/tmp/tmpmt1ahq9p/tmpd2ttzx5a.py", line 45
print ' '.join(map(str, mergeSort(A)))print count
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s449045868 | p02272 | u854228079 | 1442384796 | Python | Python | py | Runtime Error | 0 | 0 | 1054 | global count
acount = 0
def merge(num_list, left, mid, right):
a = mid - left
b = right - mid
L = []
R = []
for i in range(a):
L.append(num_list[left + i])
for i in range(b):
R.append(num_list[mid + i])
L.append(float("inf"))
R.append(float("inf"))
i = 0
j = 0
global count
for k in range(left, right):
if L[i] <= R[j]:
num_list[k] = L[i]
i += 1
else:
num_list[k] = R[j]
j += 1
count += 1
def mergeSort(num_list, left, right):
if left+1 < right:
mid = (left + right) / 2
mergeSort(num_list, left, mid)
mergeSort(num_list, mid, right)
merge(num_list, left, mid, right)
return num_list
if __name__ == "__main__":
num = raw_input()
line = raw_input()
num_list = line.strip().split()
num_list = map(int, num_list)
merge_list = mergeSort(num_list, 0, len(num_list))
merge_list = map(str, merge_list)
print " ".join(merge_list)
print count | File "/tmp/tmpgb8owj5h/tmpzjzzycgp.py", line 52
print " ".join(merge_list)
^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s212881179 | p02272 | u488601719 | 1448720286 | Python | Python3 | py | Runtime Error | 0 | 0 | 1872 | def merge(A, left, mid, right):
global count
L = A[left:mid]
R = A[mid:right]
R.append[1000000001]
L.append[1000000001]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
count += right - left
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
N = int(input())
A = list(map(int, input().split()))
count = 0
merge_sort(A, 0, N)
print(*A)
print(count)
def merge(A, left, mid, right):
global count
L = A[left:mid] + [1000000001]
R = A[mid:right] + [1000000001]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
count += right - left
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
N = int(input())
A = list(map(int, input().split()))
count = 0
def merge(A, left, mid, right):
global count
L = A[left:mid]
R = A[mid:right]
R.append[1000000001]
L.append[1000000001]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
count += right - left
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
N = int(input())
A = list(map(int, input().split()))
count = 0
merge_sort(A, 0, N)
print(*A)
print(count) | Traceback (most recent call last):
File "/tmp/tmphx3912z6/tmpsqfy01qz.py", line 26, in <module>
N = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s900729887 | p02272 | u247279609 | 1459310081 | Python | Python | py | Runtime Error | 0 | 0 | 794 | count = 0
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right)/2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
def merge(A, left, mid, right):
n1 = mid -left
n2 = right - mid
L = [0] * (n1+1)
R = [0] * (n2+1)
for i in range(0, n1):
L[i] = A[left+i]
for i in range(0, n2):
R[i] = A[mid+i]
L[n1] = 999999999999999999999
R[n2] = 999999999999999999999
i = 0
j = 0
for k in range(left,right):
count = count + 1
if L[i] <=R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j+1
n = int(raw_input(''))
A = raw_input('').split(' ')
mergeSort(A,0,n-1)
print A.join(' ')
print count | File "/tmp/tmp2ncr6akd/tmpwujcvn7m.py", line 38
print A.join(' ')
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s057195260 | p02272 | u963402991 | 1459387955 | Python | Python3 | py | Runtime Error | 2120 | 29424 | 820 | def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [A[left + i] for i in range(n1)]
R = [A[mid + i] for i in range(n2)]
# ??????
L.append(500001)
R.append(500001)
i, j, c = 0, 0, 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
c += 1
else:
A[k] = R[j]
j += 1
c += 1
return c
def merge_Sort(A, left, right):
count = 0
if left + 1 < right:
mid = int((left + right) / 2)
count += merge_Sort(A, left, mid)
count += merge_Sort(A, mid, right)
count += merge(A, left, mid, right)
return count
n = int(input())
A = list(map(int, input().split()))
count = merge_Sort(A, 0, n)
print(' '.join(map(str,A)))
print(count) | Traceback (most recent call last):
File "/tmp/tmptz6h5_09/tmpu_i9681h.py", line 31, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s101399912 | p02272 | u963402991 | 1459388674 | Python | Python3 | py | Runtime Error | 0 | 0 | 759 | def merge(A, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
banpei = 10 ** 9 + 1
L, R = L + [banpei], R + [banpei]
L = [A[left + i] for i in range(n1)]
R = [A[mid + i] for i in range(n2)]
i, j = 0, 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
count += right - left
def merge_Sort(A, left, right):
if 1 < right - left:
mid = int((left + right) / 2)
merge_Sort(A, left, mid)
merge_Sort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A = list(map(int, input().split()))
count = 0
merge_Sort(A, 0, n)
print(' '.join(map(str, A)))
print(count) | Traceback (most recent call last):
File "/tmp/tmpotowwwk4/tmpgl_7dphi.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s813931990 | p02272 | u670498238 | 1466217955 | Python | Python3 | py | Runtime Error | 0 | 0 | 813 | sentinel = 10**10
def Merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0 for x in range(n1 + 1)]
R = [0 for x in range(n2 + 1)]
L[n1] = sentinel
R[n2] = sentinel
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
def Merge_Sort(A, left, right):
global count
count += 1
if left + 1 < right:
mid = (left + right) // 2
Merge_Sort(A, left, mid)
Merge_Sort(A, mid, right)
Merge(A, left, mid, right)
n = input()
A = list(map(int, input().split()))
Merge_Sort(A, 0, len(A))
print(*A)
print(count) | Traceback (most recent call last):
File "/tmp/tmpowutvl77/tmpxlpme4_a.py", line 35, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s031652912 | p02272 | u742013327 | 1477457577 | Python | Python3 | py | Runtime Error | 0 | 0 | 932 | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_5_B&lang=jp
count = 0
def merge(l,r):
global count
l_index = 0
r_index = 0
merge_list = []
l.append(pow(10,9) + 1)
r.append(pow(10,9) + 1)
for k in range(len(l) + len(r) - 2):
count += 1
if l[l_index] < r[r_index]:
merge_list.append(l[l_index])
l_index += 1
else:
merge_list.append(r[r_index])
r_index += 1
return merge_list
def merge_sort(target_list):
if len(target_list) == 1:
return target_list
mid = int(len(target_list) / 2)
r = merge_sort(target_list[mid:])
l = merge_sort(target_list[:mid])
return merge(l, r)
if __name__ == "__main__":
l = input()
target_list = [int(a) for a in input().split()]
global count
print(" ".join([str(n) for n in merge_sort(target_list)]))
print(count) | File "/tmp/tmp8xv2z2g8/tmp9_1yx15b.py", line 36
global count
^^^^^^^^^^^^
SyntaxError: name 'count' is assigned to before global declaration
| |
s408307040 | p02272 | u742013327 | 1477457819 | Python | Python3 | py | Runtime Error | 0 | 0 | 932 | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_5_B&lang=jp
count = 0
def merge(l,r):
global count
l_index = 0
r_index = 0
merge_list = []
l.append(pow(10,9) + 1)
r.append(pow(10,9) + 1)
for k in range(len(l) + len(r) - 2):
count += 1
if l[l_index] < r[r_index]:
merge_list.append(l[l_index])
l_index += 1
else:
merge_list.append(r[r_index])
r_index += 1
return merge_list
def merge_sort(target_list):
if len(target_list) == 1:
return target_list
mid = int(len(target_list) / 2)
r = merge_sort(target_list[mid:])
l = merge_sort(target_list[:mid])
return merge(l, r)
if __name__ == "__main__":
l = input()
target_list = [int(a) for a in input().split()]
global count
print(" ".join([str(n) for n in merge_sort(target_list)]))
print(count) | File "/tmp/tmpyzuq2m7l/tmp0_3kpkfo.py", line 36
global count
^^^^^^^^^^^^
SyntaxError: name 'count' is assigned to before global declaration
| |
s176035452 | p02272 | u216804574 | 1479027492 | Python | Python3 | py | Runtime Error | 0 | 0 | 120 | h, w = [int(n) for n in input().split()]
for i in range(0, h):
for j in range(0, w):
print("#", end='')
print() | Traceback (most recent call last):
File "/tmp/tmp0mqnxfsl/tmpx9ladtke.py", line 1, in <module>
h, w = [int(n) for n in input().split()]
^^^^^^^
EOFError: EOF when reading a line
| |
s458985651 | p02272 | u195186080 | 1480690599 | Python | Python3 | py | Runtime Error | 0 | 0 | 665 | counter = 0
def merge(L, R, left, right):
A=[]
L.append(float('inf'))
R.append(float('inf'))
i,j=(0,0)
global counter
for n in range(0,right-left):
counter = counter+1
if L[i]<=R[j]:
A[n]=L[i]
i=i+1
else:
A[n]=R[j]
j=j+1
return A
def mergeSort(A, left, right):
if left+1 < right:
mid = int((left+right)/2)
L = mergeSort(A[left:mid],0,mid-left)
R = mergeSort(A[mid:right],0,right-mid)
A = merge(L, R, left, right)
return A
n = int(input())
l = list(map(int,input().split()))
ll = mergeSort(l,0,n)
print(*ll)
print(counter) | Traceback (most recent call last):
File "/tmp/tmpj_sahh2z/tmpi0j04q4e.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s047162571 | p02272 | u195186080 | 1480691572 | Python | Python3 | py | Runtime Error | 0 | 0 | 684 | counter = 0
def merge(L, R, left, right):
A = range(0,right-left)
L.append(float('inf'))
R.append(float('inf'))
i,j=(0,0)
global counter
for n in range(0,right-left):
counter = counter+1
if L[i]<=R[j]:
A[n]=L[i]
i=i+1
else:
A[n]=R[j]
j=j+1
return A
def mergeSort(A, left, right):
if left+1 < right:
mid = int((left+right)/2)
L = mergeSort(A[left:mid],0,mid-left)
R = mergeSort(A[mid:right],0,right-mid)
A = merge(L, R, left, right)
return A
n = int(input())
l = list(map(int,input().split()))
ll = mergeSort(l,0,n)
print(*ll)
print(counter) | Traceback (most recent call last):
File "/tmp/tmpudbshmvc/tmpyujhvjog.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s169613949 | p02272 | u711765449 | 1486295901 | Python | Python3 | py | Runtime Error | 0 | 0 | 877 | import math
n = int(input())
S = list(map(int,input().split()))
def merge(A, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
L = []
for i in range(n1+1):
L.append(i)
R = []
for i in range(n2+1):
R.append(i)
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1] = math.inf
R[n2] = math.inf
i = 0
j = 0
sum = 0
for k in range(left,right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
count += right - left
def mergeSort(A, left, right):
if left + 1 < right:
mid = int((left + right) / 2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
count = 0
mergeSort(S,0,len(S))
print(*S)
print(count) | Traceback (most recent call last):
File "/tmp/tmpio55ajf2/tmpcek9e2ay.py", line 2, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s734181417 | p02272 | u711765449 | 1486296003 | Python | Python3 | py | Runtime Error | 0 | 0 | 877 | import math
n = int(input())
S = list(map(int,input().split()))
def merge(A, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
L = []
for i in range(n1+1):
L.append(i)
R = []
for i in range(n2+1):
R.append(i)
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1] = math.inf
R[n2] = math.inf
i = 0
j = 0
sum = 0
for k in range(left,right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
count += right - left
def mergeSort(A, left, right):
if left + 1 < right:
mid = int((left + right) / 2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
count = 0
mergeSort(S,0,len(S))
print(*S)
print(count) | Traceback (most recent call last):
File "/tmp/tmpcw3silha/tmpy64jyn31.py", line 2, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s555046166 | p02272 | u831244171 | 1487510804 | Python | Python3 | py | Runtime Error | 0 | 0 | 677 | from collections import deque
count = 0
def merge(A,left,mid,right):
L = deque(A[left:mid])
R = deque(A[mid:right])
L.append(10**9)
R.append(10**9)
global count
for k in range(left,right):
count +=1
if L[0] <= R[0]:
A[k] = L.popleft()
else:
A[k] = R.popleft()
def mergeSort(A,left,right):
if left + 1 < right:
middle = (left + right) //2
mergeSort(A,left,middle)
mergeSort(A,middle,right)
merge(A,left,middle,right)
input()
l = list(map(int,input().split()))
mergeSort(l,0,len(l))
print(" ".join(l))
print(count)
| Traceback (most recent call last):
File "/tmp/tmpnbtel0pe/tmp80gft865.py", line 28, in <module>
input()
EOFError: EOF when reading a line
| |
s996229929 | p02272 | u148628801 | 1487661732 | Python | Python3 | py | Runtime Error | 0 | 0 | 1021 | import sys
def merge(A, left, mid, right, num_compare):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1)]
R = [0 for i in range(n2)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
i = 0
j = 0
num_compare += right - left
for k in range(left, right):
if j >= n2:
A[k] = L[i]
i += 1
elif i < n1 and L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return num_compare
def merge_sort(A, left, right, num_compare):
if left + 1 < right:
mid = (left + right) // 2
num_compare = merge_sort(A, left, mid, num_compare)
num_compare = merge_sort(A, mid, right, num_compare)
num_compare = merge(A, left, mid, right, num_compare)
return num_compare
fin = open("test.txt", "r")
#fin = sys.stdin
n = int(fin.readline())
S = list(map(int, fin.readline().split()))
num_compare = 0
num_compare = merge_sort(S, 0, n, num_compare)
print(S[0], end = "")
for s in S[1:]:
print(" " + str(s), end = "")
print("")
print(num_compare) | Traceback (most recent call last):
File "/tmp/tmpphhxt0_x/tmprynblowk.py", line 42, in <module>
fin = open("test.txt", "r")
^^^^^^^^^^^^^^^^^^^^^
FileNotFoundError: [Errno 2] No such file or directory: 'test.txt'
| |
s983472725 | p02272 | u148628801 | 1487663228 | Python | Python3 | py | Runtime Error | 0 | 0 | 912 | import sys
def merge(A, left, mid, right, num_compare):
n1 = mid - left
n2 = right - mid
L = A[left:mid] + [SENTINEL]
R = A[mid:right] + [SENTINEL]
i = 0
j = 0
num_compare += right - left
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return num_compare
def merge_sort(A, left, right, num_compare):
if left + 1 < right:
mid = (left + right) // 2
num_compare = merge_sort(A, left, mid, num_compare)
num_compare = merge_sort(A, mid, right, num_compare)
num_compare = merge(A, left, mid, right, num_compare)
return num_compare
fin = open("test.txt", "r")
#fin = sys.stdin
SENTINEL = float("inf")
n = int(fin.readline())
S = list(map(int, fin.readline().split()))
num_compare = 0
num_compare = merge_sort(S, 0, n, num_compare)
print(S[0], end = "")
for s in S[1:]:
print(" " + str(s), end = "")
print("")
print(num_compare) | Traceback (most recent call last):
File "/tmp/tmp5myowjbg/tmpgjkomadb.py", line 33, in <module>
fin = open("test.txt", "r")
^^^^^^^^^^^^^^^^^^^^^
FileNotFoundError: [Errno 2] No such file or directory: 'test.txt'
| |
s040246025 | p02272 | u854976463 | 1488846467 | Python | Python | py | Runtime Error | 0 | 0 | 1993 | global cmt
cmt = 0
def Merge(left, right):
global cnt
lst = []
i, j = 0, 0
while i < len(left) and j < len(right):
if left[i] <= right[j]:
lst.append(left[i])
i += 1
else:
lst.append(right[j])
j += 1
lst += left[i:]
lst += right[j:]
cmt += len(lst)
return lst
def MergeSort(A):
if len(A) == 1: return A
mid = len(A) / 2
left = MergeSort(A[:mid])
right = MergeSort(A[mid:])
#print left, right
sortedList = Merge(left, right)
return sortedList
n = raw_input()
for n in MergeSort(map(int, raw_input().split())):
print output, ' '
print cmt | File "/tmp/tmpo4fweksj/tmpvjj5zvj0.py", line 31
print output, ' '
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s332628015 | p02272 | u301461168 | 1489599319 | Python | Python3 | py | Runtime Error | 2170 | 31132 | 934 | def merge(A, left, mid, right, cnt):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=100000000
R[n2]=100000000
cnt1 = 0
cnt2 = 0
for k in range(left, right):
if L[cnt1] <= R[cnt2]:
A[k] = L[cnt1]
cnt1 += 1
else:
A[k] = R[cnt2]
cnt2 += 1
cnt.append(cnt1 + cnt2)
def mergeSort(A, left, right, cnt):
if left+1 < right:
mid = (left + right)//2
mergeSort(A, left, mid, cnt)
mergeSort(A, mid, right, cnt)
merge(A, left, mid, right, cnt)
n = int(input().rstrip())
A = list(map(int,input().split(" ")))
cnt = []
mergeSort(A, 0 , len(A), cnt)
print(" ".join(list(map(str,A))))
print(str(sum(cnt))) | Traceback (most recent call last):
File "/tmp/tmpv49r9suv/tmptcq0uv2b.py", line 39, in <module>
n = int(input().rstrip())
^^^^^^^
EOFError: EOF when reading a line
| |
s222883915 | p02272 | u301461168 | 1489599503 | Python | Python3 | py | Runtime Error | 2150 | 29460 | 939 | def merge(A, left, mid, right, cnt):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=100000000
R[n2]=100000000
cnt1 = 0
cnt2 = 0
for k in range(left, right):
if L[cnt1] <= R[cnt2]:
A[k] = L[cnt1]
cnt1 += 1
else:
A[k] = R[cnt2]
cnt2 += 1
cnt[0] = cnt[0] + cnt1 + cnt2
def mergeSort(A, left, right, cnt):
if left+1 < right:
mid = (left + right)//2
mergeSort(A, left, mid, cnt)
mergeSort(A, mid, right, cnt)
merge(A, left, mid, right, cnt)
n = int(input().rstrip())
A = list(map(int,input().split(" ")))
cnt = [0]
mergeSort(A, 0 , len(A), cnt)
print(" ".join(list(map(str,A))))
print(str(cnt[0])) | Traceback (most recent call last):
File "/tmp/tmp02izbyjk/tmpg27067h7.py", line 39, in <module>
n = int(input().rstrip())
^^^^^^^
EOFError: EOF when reading a line
| |
s164869360 | p02272 | u301461168 | 1489599773 | Python | Python3 | py | Runtime Error | 2100 | 29424 | 913 | def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=100000000
R[n2]=100000000
cnt1 = 0
cnt2 = 0
for k in range(left, right):
if L[cnt1] <= R[cnt2]:
A[k] = L[cnt1]
cnt1 += 1
else:
A[k] = R[cnt2]
cnt2 += 1
global cnt
cnt += cnt1 + cnt2
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right)//2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
n = int(input().rstrip())
A = list(map(int,input().split(" ")))
cnt = 0
mergeSort(A, 0 , len(A))
print(" ".join(list(map(str,A))))
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmpi3i08ji7/tmpntve4ytx.py", line 41, in <module>
n = int(input().rstrip())
^^^^^^^
EOFError: EOF when reading a line
| |
s735340627 | p02272 | u300946041 | 1490612406 | Python | Python3 | py | Runtime Error | 0 | 0 | 950 | # -*- coding: utf-8 -*-
count = 0
left_arr = []
right_arr = []
def merge(a, n, left, mid, right):
n1 = mid - left
for i in range(n1):
left_arr[i] = a[left + 1]
n2 = right - mid
for i in range(n2):
right_arr[i] = a[mid + i]
left_arr[n1] = right_arr[n2] = 20 * 1000000
i = j = 0
for k in range(left, right):
count += 1
if left_arr[i] <= right_arr[j]:
i += 1
a[k] = left_arr[i]
else:
j += 1
a[k] = right_arr[j]
return a
def merge_sort(a, n, left, right):
if (left + 1) < right:
mid = (left + right) // 2
merge_sort(a, n, left, mid)
merge_sort(a, n, mid, right)
arr = merge(a, n, left, mid, right)
return arr
def main():
n = int(input())
a = [int(e) for e in input().split()]
sorted_arr = merge_sort(a, n, 0, n)
return " ".join(sorted_arr)
print(main())
print(count) | Traceback (most recent call last):
File "/tmp/tmpqtcdmz75/tmpk8m7dsaa.py", line 47, in <module>
print(main())
^^^^^^
File "/tmp/tmpqtcdmz75/tmpk8m7dsaa.py", line 41, in main
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s948418073 | p02272 | u300946041 | 1490671435 | Python | Python3 | py | Runtime Error | 0 | 0 | 1035 | # -*- coding: utf-8 -*-
infinity = 10 ** 9
def merge(ns, left, mid, right, count):
n1 = mid - left
n2 = right - mid
left_ns = [e for e in range(n1)]
right_ns = [e for e in range(n2)]
for i in range(n1):
left_ns[i] = ns[left + i]
for i in range(n2):
right_ns[i] = ns[mid + i]
left_ns[n1] = infinity
right_ns[n2] = infinity
i = 0
j = 0
for k in range(left, right):
count += 1
if left_ns[i] <= right_ns[j]:
ns[k] = left_ns[i]
i += 1
else:
ns[k] = right_ns[j]
j += 1
return ns, count
def merge_sort(ns, left, right):
count = 0
if left + 1 < right:
mid = (left + right) // 2
merge_sort(ns, left, mid)
merge_sort(ns, mid, right)
ns, count = merge(ns, left, mid, right, count)
return ns, count
n = int(input())
ns = [int(e) for e in input().split()]
left = 0
right = len(ns)
ns, count = merge_sort(ns, left, right)
print(" ".join(ns))
print(count) | Traceback (most recent call last):
File "/tmp/tmpyxoe_xy0/tmpjim7fa2s.py", line 43, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s376115164 | p02272 | u300946041 | 1490671674 | Python | Python3 | py | Runtime Error | 0 | 0 | 972 | # -*- coding: utf-8 -*-
infinity = 10 ** 9
count = 0
def merge(ns, left, mid, right):
n1 = mid - left
n2 = right - mid
left_ns = [e for e in range(n1)]
right_ns = [e for e in range(n2)]
for i in range(n1):
left_ns[i] = ns[left + i]
for i in range(n2):
right_ns[i] = ns[mid + i]
left_ns[n1] = infinity
right_ns[n2] = infinity
i = 0
j = 0
for k in range(left, right):
count += 1
if left_ns[i] <= right_ns[j]:
ns[k] = left_ns[i]
i += 1
else:
ns[k] = right_ns[j]
j += 1
def merge_sort(ns, left, right):
count = 0
if left + 1 < right:
mid = (left + right) // 2
merge_sort(ns, left, mid)
merge_sort(ns, mid, right)
merge(ns, left, mid, right, count)
n = int(input())
ns = [int(e) for e in input().split()]
left = 0
right = len(ns)
merge_sort(ns, left, right)
print(" ".join(ns))
print(count) | Traceback (most recent call last):
File "/tmp/tmps0bakc8o/tmp88vbbt4w.py", line 42, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s410493008 | p02272 | u300946041 | 1490673712 | Python | Python3 | py | Runtime Error | 0 | 0 | 1042 | # -*- coding: utf-8 -*-
infinity = pow(10, 9) + 1
def merge(ns, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
# left_ns = [e for e in range(n1 + 1)]
# right_ns = [e for e in range(n2 + 1)]
left_ns = ns[left:mid]
right_ns = ns[mid:right]
# for i in range(n1):
# left_ns[i] = ns[left + i]
# for i in range(n2):
# right_ns[i] = ns[mid + i]
left_ns[n1] = infinity
right_ns[n2] = infinity
i = 0
j = 0
for k in range(left, right):
count += 1
if left_ns[i] <= right_ns[j]:
ns[k] = left_ns[i]
i += 1
else:
ns[k] = right_ns[j]
j += 1
def merge_sort(ns, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(ns, left, mid)
merge_sort(ns, mid, right)
merge(ns, left, mid, right)
n = int(input())
ns = [int(e) for e in input().split()]
left = 0
right = len(ns)
count = 0
merge_sort(ns, left, right)
print(*ns)
print(count) | Traceback (most recent call last):
File "/tmp/tmp1_4u3kcs/tmp6jkv_fph.py", line 43, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s814794020 | p02272 | u130834228 | 1490871419 | Python | Python3 | py | Runtime Error | 0 | 0 | 764 | def merge(A, left, mid, right):
n1 = mid-left
n2 = right-mid
L = [0 for i in range(n1)]
R = [0 for i in range(n2)]
for i in range(n1):
L[i] = A[left+i]
for i in range(n2):
R[i] = A[mid+i]
L[n1] = inf
R[n2] = inf
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i = i+1
else:
A[k] = R[j]
j = j+1
global cnt
cnt += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left+right) / 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
n = input()
A = list(map(int, input().split()))
cnt = 0
mergeSort(A, 0, len(A))
print(*A)
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmp_5kag6zz/tmpwekjmh98.py", line 30, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s806559075 | p02272 | u130834228 | 1491046459 | Python | Python3 | py | Runtime Error | 2280 | 29384 | 914 | def merge(A, left, mid, right):
n1 = mid-left
n2 = right-mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left+i]
for i in range(n2):
R[i] = A[mid+i]
L[n1] = 100000001
R[n2] = 100000001
i = 0
j = 0
#global cnt
cnt = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i = i+1
cnt +=1
else:
A[k] = R[j]
j = j+1
cnt +=1
return cnt
def mergeSort(A, left, right):
if left+1 < right:
mid = (left+right) // 2
cnt1 = mergeSort(A, left, mid)
cnt2 = mergeSort(A, mid, right)
cnt3 = merge(A, left, mid, right)
return cnt1+cnt2+cnt3
else:
return 0
n = input()
A = list(map(int, input().split()))
cnt = mergeSort(A, 0, len(A))
print(*A)
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmp7e7flq6j/tmpysrvzord.py", line 38, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s119224255 | p02272 | u130834228 | 1491046503 | Python | Python3 | py | Runtime Error | 2290 | 29296 | 914 | def merge(A, left, mid, right):
n1 = mid-left
n2 = right-mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left+i]
for i in range(n2):
R[i] = A[mid+i]
L[n1] = 100000001
R[n2] = 100000001
i = 0
j = 0
#global cnt
cnt = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i = i+1
cnt +=1
else:
A[k] = R[j]
j = j+1
cnt +=1
return cnt
def mergeSort(A, left, right):
if left+1 < right:
mid = (left+right) // 2
cnt1 = mergeSort(A, left, mid)
cnt2 = mergeSort(A, mid, right)
cnt3 = merge(A, left, mid, right)
return cnt1+cnt2+cnt3
else:
return 0
n = input()
A = list(map(int, input().split()))
cnt = mergeSort(A, 0, len(A))
print(*A)
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmpwz4swv78/tmprs3mg4hc.py", line 38, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s205605474 | p02272 | u546285759 | 1491383465 | Python | Python3 | py | Runtime Error | 1660 | 29268 | 635 | def merge(A, left, mid, right):
global cnt
inf = 5000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
cnt += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
cnt = 0
n = int(input())
A = list(map(int, input().split()))
mergeSort(A, 0, n)
print(*A)
print(cnt) | Traceback (most recent call last):
File "/tmp/tmpd84a_pjj/tmp8eqsswy9.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s881669549 | p02272 | u546285759 | 1491383532 | Python | Python3 | py | Runtime Error | 1640 | 29232 | 636 | def merge(A, left, mid, right):
global cnt
inf = 50000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
cnt += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
cnt = 0
n = int(input())
A = list(map(int, input().split()))
mergeSort(A, 0, n)
print(*A)
print(cnt) | Traceback (most recent call last):
File "/tmp/tmp_dwwd9xp/tmpkeq2zg_x.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s639539595 | p02272 | u546285759 | 1491383575 | Python | Python3 | py | Runtime Error | 1650 | 29312 | 637 | def merge(A, left, mid, right):
global cnt
inf = 500000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
cnt += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
cnt = 0
n = int(input())
A = list(map(int, input().split()))
mergeSort(A, 0, n)
print(*A)
print(cnt) | Traceback (most recent call last):
File "/tmp/tmp64byyy51/tmppw2feq7x.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s239441587 | p02272 | u546285759 | 1491383688 | Python | Python3 | py | Runtime Error | 1670 | 29288 | 645 | def merge(A, left, mid, right):
global cnt
inf = 500000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
cnt += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
cnt = 0
n = int(input())
A = list(map(int, input().strip().split()))
mergeSort(A, 0, n)
print(*A)
print(cnt) | Traceback (most recent call last):
File "/tmp/tmpc3iuh7vg/tmp6hfvl914.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s866306754 | p02272 | u130834228 | 1492064264 | Python | Python3 | py | Runtime Error | 0 | 0 | 842 | def merge(A, left, mid, right):
n1 = mid-left
n2 = right-mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left+i]
for i in range(n2):
R[i] = A[mid+i]
L[n1] = float('inf')
R[n2] = float('inf')
i = 0
j = 0
global cnt
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
A[k] = L[i]
i = i+1
else:
A[k] = R[j]
j = j+1
return cnt
def mergeSort(A, left, right):
if left+1 < right:
mid = (left+right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
else:
return 0
n = input()
A = list(map(int, input().split()))
cnt = mergeSort(A, 0, len(A))
print(*A)
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmpunfyiiag/tmp0pyhn2lx.py", line 37, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s182381628 | p02272 | u130834228 | 1492064466 | Python | Python3 | py | Runtime Error | 0 | 0 | 893 | def merge(A, left, mid, right):
#n1 = mid-left
#n2 = right-mid
#L = [0 for i in range(n1+1)]
#R = [0 for i in range(n2+1)]
#for i in range(n1):
# L[i] = A[left+i]
#for i in range(n2):
# R[i] = A[mid+i]
L = A[left:mid]
R = A[mid:right]
L[n1] = float('inf')
R[n2] = float('inf')
i = 0
j = 0
global cnt
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
A[k] = L[i]
i = i+1
else:
A[k] = R[j]
j = j+1
return cnt
def mergeSort(A, left, right):
if left+1 < right:
mid = (left+right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
else:
return 0
n = input()
A = list(map(int, input().split()))
cnt = 0
mergeSort(A, 0, len(A))
print(*A)
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmpp3ge5_31/tmp21xad2x5.py", line 39, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s325566691 | p02272 | u130834228 | 1492064485 | Python | Python3 | py | Runtime Error | 0 | 0 | 891 | def merge(A, left, mid, right):
n1 = mid-left
n2 = right-mid
#L = [0 for i in range(n1+1)]
#R = [0 for i in range(n2+1)]
#for i in range(n1):
# L[i] = A[left+i]
#for i in range(n2):
# R[i] = A[mid+i]
L = A[left:mid]
R = A[mid:right]
L[n1] = float('inf')
R[n2] = float('inf')
i = 0
j = 0
global cnt
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
A[k] = L[i]
i = i+1
else:
A[k] = R[j]
j = j+1
return cnt
def mergeSort(A, left, right):
if left+1 < right:
mid = (left+right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
else:
return 0
n = input()
A = list(map(int, input().split()))
cnt = 0
mergeSort(A, 0, len(A))
print(*A)
print(str(cnt)) | Traceback (most recent call last):
File "/tmp/tmpzu76idi9/tmp4hsyhkdn.py", line 39, in <module>
n = input()
^^^^^^^
EOFError: EOF when reading a line
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.