buggy stringlengths 1 618k | fixed stringlengths 16 618k | buggy_submission_id stringlengths 10 10 | fixed_submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | lang stringclasses 1
value | buggy_verdict stringclasses 2
values |
|---|---|---|---|---|---|---|
n = int(input())
m = list(input(n))
if n % sum(m)==0:
print("Yes")
else:
print("No") | n = input()
m = sum(map(int,n))
if int(n) % m==0:
print("Yes")
else:
print("No") | s290688340 | s206565683 | p03502 | python | Runtime Error |
N = int(input())
F = [list(map(int,input().split())) for i in range(N)]
P = [list(map(int,input().split())) for i in range(N)]
ans = -10**9
for i in range(2**10-1):
Bit = [1]**10
for j in range(10):
if (i>>j)&1:
Bit[j]=0
count = 0
for k in range(N):
op = sum(b&f for b,f in zip(Bit,F[k]))
cou... | N = int(input())
F = [list(map(int,input().split())) for i in range(N)]
P = [list(map(int,input().split())) for i in range(N)]
ans = -10**9
for i in range(2**10-1):
Bit = [1]*10
for j in range(10):
if (i>>j)&1:
Bit[j]=0
count = 0
for k in range(N):
op = sum(b&f for b,f in zip(Bit,F[k]))
coun... | s461532404 | s146202578 | p03503 | python | Runtime Error |
N = int(input())
F = [list(map(int,input().split())) for i in range(N)]
P = [list(map(int,input().split())) for i in range(N)]
ans = -10**9
for i in range(2**10-1):
Bit = [0]**10
for j in range(10):
if (i>>j)&1:
Bit[j]=1
count = 0
for k in range(N):
op = sum(b&f for b,f in zip(Bit,F[k]))
coun... | N = int(input())
F = [list(map(int,input().split())) for i in range(N)]
P = [list(map(int,input().split())) for i in range(N)]
ans = -10**9
for i in range(2**10-1):
Bit = [1]*10
for j in range(10):
if (i>>j)&1:
Bit[j]=0
count = 0
for k in range(N):
op = sum(b&f for b,f in zip(Bit,F[k]))
coun... | s279483286 | s146202578 | p03503 | python | Runtime Error |
a = int(input())
print("Yes" if a[1]==a[2]==a[0] or a[1]==a[2]==a[3], else "No") | a = input()
print("Yes" if a[0]==a[1]==a[2] or a[1]==a[2]==a[3] else "No") | s065082798 | s195698469 | p03543 | python | Runtime Error |
a = input()
print("Yes" if a[1]==a[2]==a[0] or a[1]==a[2]==a[3], else "No") | a = input()
print("Yes" if a[0]==a[1]==a[2] or a[1]==a[2]==a[3] else "No") | s370094615 | s195698469 | p03543 | python | Runtime Error |
a = input()
print("Yes" if a[1]==a[2]==a[3] or a[4]==a[2]==a[3], else "No") | a = input()
print("Yes" if a[0]==a[1]==a[2] or a[1]==a[2]==a[3] else "No") | s709143805 | s195698469 | p03543 | python | Runtime Error |
x =[list(map(str,input().split())) for i in range(2)]
if x[0][0]==x[1][0] and x[0][1]==x[1][1] and x[0][2]==x[1][2]:
print("YES")
else:
print("NO") | x =[str(input()) for i in range(2)]
if x[0][0]==x[1][2] and x[0][1]==x[1][1] and x[0][2]==x[1][0]:
print("YES")
else:
print("NO") | s660395646 | s048406751 | p03555 | python | Runtime Error |
x = int(input())
a = [0]
for i in range(10**5):
if i**2<x:
a.add(i**2)
else:
break
print(max(a)) | x = int(input())
for i in range(10**5):
if i**2>x:
a=((i-1)**2)
break
print(a) | s104044293 | s384938567 | p03556 | python | Runtime Error |
import bisect
n = int(input())
x = sorted(list(map(int,input().split())), reverse=True)
y = sorted(list(map(int,input().split())), reverse=True)
z = sorted(list(map(int,input().split())), reverse=True)
count = 0
X =[]
for b in range(n):
k = bisect.bisect_right(x,y[b])
X[b] =(n-k)
for a in range(n):
j = bisect.bis... | import bisect
n = int(input())
X = sorted(list(map(int,input().split())))
Y = sorted(list(map(int,input().split())))
Z = sorted(list(map(int,input().split())))
print(sum(bisect.bisect_left(X,b) * (n-bisect.bisect_right(Z,b)) for b in Y)) | s365011370 | s515212890 | p03557 | python | Runtime Error |
import bisect
n = int(input())
x = sorted(list(map(int,input().split())), reverse=True)
y = sorted(list(map(int,input().split())), reverse=True)
z = sorted(list(map(int,input().split())), reverse=True)
count = 0
X =[]
for b in range(n):
k = bisect.bisect_right(x,y[b])
X[b] =(n-k)
for a in range(n):
j = bisect.bis... | import bisect
n = int(input())
X = sorted(list(map(int,input().split())))
Y = sorted(list(map(int,input().split())))
Z = sorted(list(map(int,input().split())))
print(sum(bisect.bisect_left(X,b) * (n-bisect.bisect_right(Z,b)) for b in Y)) | s095455600 | s515212890 | p03557 | python | Runtime Error |
n = int(input())
x = sorted(list(map(int,input().split())))[::-1]
y = sorted(list(map(int,input().split())))[::-1]
z = sorted(list(map(int,input().split())))[::-1]
count = 0
for a in range(n):
j = bisect.bisect_right(y,z[a])
for b in range(j,n-1):
k = bisect.bisect_right(x,y[b])
count+=(n-k)
print(count) | import bisect
n = int(input())
X = sorted(list(map(int,input().split())))
Y = sorted(list(map(int,input().split())))
Z = sorted(list(map(int,input().split())))
print(sum(bisect.bisect_left(X,b) * (n-bisect.bisect_right(Z,b)) for b in Y)) | s230972597 | s515212890 | p03557 | python | Runtime Error |
a,b,c=map(int,input().split())
print(a if b=c else b if a=c else c) | a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c) | s630118171 | s223080728 | p03573 | python | Runtime Error |
a,b,c=map(int,input().split())
print(a if b=c b elif a=c c else) | a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c) | s667138092 | s223080728 | p03573 | python | Runtime Error |
import collections
n = int(input())
alist = [int(input()) for i in range(n)]
cole = collections.Counters(alist)
count = 0
for i in cole.values():
if i%2==1:
count+=1
print(count) | import collections
n = int(input())
alist = [int(input()) for i in range(n)]
cole = collections.Counter(alist)
count = 0
for i in cole.values():
if i%2==1:
count+=1
print(count) | s596993544 | s985123431 | p03607 | python | Runtime Error |
n=input()
a = []
for i in range(0,len(n)+1,2):
a.append(str(n[i]))
print(*a) | n=input()
a = []
a.append(str(n[:len(n):2]))
print(*a) | s663730841 | s619373373 | p03610 | python | Runtime Error |
n=input()
import math
a = []
for i in range(0,math.ceil(len(n)/2),2):
a.append(str(a[i]))
print(*a) | n=input()
a = []
a.append(str(n[:len(n):2]))
print(*a) | s733134116 | s619373373 | p03610 | python | Runtime Error |
n=input()
import math
a = []
for i in range(0,math.ceil(n/2),2):
a.append(str(a[i]))
print(*a) | n=input()
a = []
a.append(str(n[:len(n):2]))
print(*a) | s798439196 | s619373373 | p03610 | python | Runtime Error |
n=input()
import math
a = []
for i in range(0,math.ceil(n/2),2):
a.append(a[i])
print(*a) | n=input()
a = []
a.append(str(n[:len(n):2]))
print(*a) | s492889353 | s619373373 | p03610 | python | Runtime Error |
s=input()
print(chr(i)) for i in range(ord("a"),ord("z")+1) if chr(i) not in s | s=input()
for i in range(ord("a"),ord("z")+1):
if chr(i) not in s:
print(chr(i))
exit()
print("None") | s464156332 | s703481360 | p03624 | python | Runtime Error |
import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
A = [0,0]
for i in adic:
if adic[i] > 1:
A.append(i)
if adic[i] > 3:
A.append(i)
sortedA = sorted(A)
print(sorted[-1]*sorted[-2]) | import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
A = [0,0]
for i in adic:
if adic[i] > 1:
A.append(i)
if adic[i] > 3:
A.append(i)
sortedA = sorted(A)
print(sortedA[-1]*sortedA[-2]) | s535415390 | s589177877 | p03627 | python | Runtime Error |
import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
for k,v in adic.items():
if v == 1:
del(adic[k])
sort_adic = sorted(adic.items(), reverse = True, key = lambda x:x[1])
li = list(sort_adic.items())
print(li[0][0]*li[1][0]) | import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
A = [0,0]
for i in adic:
if adic[i] > 1:
A.append(i)
if adic[i] > 3:
A.append(i)
sortedA = sorted(A)
print(sortedA[-1]*sortedA[-2]) | s040708066 | s589177877 | p03627 | python | Runtime Error |
import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
for k,v in adic.items():
if v == 1:
del(adic[k])
sort_adic = sorted(adic.items(), reverse = True, key = lambda x:x[1])
li = list(sort_adic.items())
print(li[0][1]*li[1][1]) | import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
A = [0,0]
for i in adic:
if adic[i] > 1:
A.append(i)
if adic[i] > 3:
A.append(i)
sortedA = sorted(A)
print(sortedA[-1]*sortedA[-2]) | s125358459 | s589177877 | p03627 | python | Runtime Error |
import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
for k,v in adic.items():
if v == 1:
del(adic[k])
sort_adic = sorted(adic.items(), reverse = True, key = lamda x:x[1])
li = list(sort_adic.items())
print(li[0][1]*li[1][1]) | import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
A = [0,0]
for i in adic:
if adic[i] > 1:
A.append(i)
if adic[i] > 3:
A.append(i)
sortedA = sorted(A)
print(sortedA[-1]*sortedA[-2]) | s478643634 | s589177877 | p03627 | python | Runtime Error |
import collections
n = int(input())
alist = list(int,input().split())
adic = collections.Counter(alist)
for k,v in adic.items():
if v == 1:
del(adic[k])
sort_adic = sorted(adic.items(), reverse = True, key = lamda x:x[1])
li = list(sort_adic.items())
print(li[0][1]*li[1][1]) | import collections
n = int(input())
alist = list(map(int,input().split()))
adic = collections.Counter(alist)
A = [0,0]
for i in adic:
if adic[i] > 1:
A.append(i)
if adic[i] > 3:
A.append(i)
sortedA = sorted(A)
print(sortedA[-1]*sortedA[-2]) | s888071492 | s589177877 | p03627 | python | Runtime Error |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.