Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03399 (python)

Fixed submission:
a,b,c,d=(int(input()) for i in range(4))
ans=min(a,b)+min(c,d)
print(ans)

Buggy submission (verdict: Runtime Error):
a,b,c.d=(int(input()) for i in range(4))
ans=min(a,b)+min(c,d)
print(ans)
Problem p03408 (python)

Fixed submission:
n=int(input())
s=list(input() for i in range(n))
m=int(input())
t=list(input() for j in range(m))
l=list(set(s))
ans=max(0,max(s.count(l[k])-t.count(l[k]) for k in range(len(l))))
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=list(input() for i in range(n))
m=int(input())
t=list(input() for j in range(m))
l=list(set(n))
ans=(max(0,s.count(l[k])-t.count(l[k])) for k in range(len(l)))
Problem p03486 (python)

Fixed submission:
s=sorted(input())
t=sorted(input())[::-1]
if s<t:
    ans="Yes"
else:
    ans="No"
print(ans)

Buggy submission (verdict: Runtime Error):
s'=sorted(input())
t'=sorted(input())
if s'<t':
    ans="Yes"
else:
    ans="No"
print(ans)
Problem p03795 (python)

Fixed submission:
n=int(input())
x=800*n
y=200*(n//15)
ans=x-y
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
x=800*N
y=200*(n//15)
ans=x-y
print(ans)
Problem p02641 (python)

Fixed submission:
x,n = map(int,input().split())

if n==0:
    print(x)
else:
    a = list(map(int,input().split()))
    lower = min(a)
    upper = max(a)
    mini = 10000005
    res = -1
    for i in range(lower-1,upper+2):
        if i not in a:
            if abs(x-i)<mini:
                mini = abs(x-i)
                res = i

    print(res)

Buggy submission (verdict: Runtime Error):
x,n = map(int,input().split())
a = list(map(int,input().split()))

lower = min(a)
upper = max(a)
mini = 10000005
res = -1
for i in range(lower-1,upper+2):
    if i not in a:
        if abs(x-i)<mini:
            mini = abs(x-i)
            res = i

print(res)
Problem p03292 (python)

Fixed submission:
a = list(map(int,input().split()))

a.sort()

print((a[2]-a[1])+(a[1]-a[0]))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
print(sum(a)-n)
Problem p02812 (python)

Fixed submission:
n = input()
s = input()
print(s.count('ABC'))

Buggy submission (verdict: Runtime Error):
n = input()
s = input()
print(s.count('ABC))
Problem p02923 (python)

Fixed submission:
N = int(input())
H_list = list(map(int, input().split()))
A_list = []
H_list.reverse()
k = 0
if N == 1:
    print(0)
else:
    for i in range(N-1):
        if H_list[i] <= H_list[i + 1]:
            k += 1
            A_list.append(k)
        else:
            k = 0
            A_list.append(k)
    if len(A_list) == 0:
        print(k)
    else:
        print(max(A_list))

Buggy submission (verdict: Runtime Error):
N = int(input())
H_list = input().split()
A_list = []
H_list.reverse()
k = 0
for i in range(N-1):
    if H_list[i] <= H_list[i + 1]:
        k += 1
    else:
        A_list.append(k)
        k = 0 
print(max(A_list))
Problem p03035 (python)

Fixed submission:
# coding: utf-8
# Your code here!
a, b = map(int, input().split())
if a >= 13:
	print(b)
elif a >= 6:
	print(b // 2)
else:
	print(0)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a >= 13:
	print(b)
elif a >= 6:
	print(b / 2)
else:
	print(0)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a >= 13:
    print(b)
elif a >= 6:
    print(b / 2)
else:
    print(0)
Problem p03385 (python)

Fixed submission:
s = input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
s = input()
if "a" in s ans "b" in s and "c" in s:
  print("Yes")
else:
  print("No")
Problem p03024 (python)

Fixed submission:
line = list(input())
win = line.count("o")
match = 15-len(line)
if win + match > 7:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
line = list(input())
win = list.count("o")
lose = line.len()-win
match = 15-line.len()
if win + match > 7:
  print("YES")
else:
  print("NO")
Problem p03214 (python)

Fixed submission:
# coding: utf-8
# Your code here!

s = input()
w = input().split()
sum = 0
for i in range(int(s)):
    sum += int(w[i])
average = sum / int(s)
limit = 100
index = 0
for i in range(int(s)):
    if abs(int(w[i]) - average) < limit:
        limit = abs(int(w[i]) - average)
        index = i
print(index)

Buggy submission (verdict: Runtime Error):
s = input()
w = input().split()
for i in range(int(s)):
  sum += int(w[i])
average = sum / int(s)
for i in range(int(s)):
    if abs(int(w[i]) - average) < limit:
        limit = abs(int(w[i]) - average)
print(limit)
Problem p03219 (python)

Fixed submission:
s = input().split()
N = int(s[0])
W = int(s[1])/2
print(int(N+W))

Buggy submission (verdict: Runtime Error):
s = input().split()
w = int(s[1])/2
print(int((s[0])+w)

Buggy submission (verdict: Runtime Error):
s = input().split()
print(int((s[0])+(int(s[1]))/2))

Buggy submission (verdict: Runtime Error):
s = input().split()
print(int((s[0])+int(s[1]))/2)
Problem p02675 (python)

Fixed submission:
n=int(input())%10
if n==3:
  print('bon')
elif n in [0,1,6,8]:
  print('pon')
else:
  print('hon')

Buggy submission (verdict: Runtime Error):
n=int(input())%10
if n=3:
  print('bon')
elif n in [0,1,6,8]:
  print('pon')
else:
  print('hon')
Problem p02783 (python)

Fixed submission:
h,a=map(int,input().split());print(h//a+1 if h%a!=0 else h//a)

Buggy submission (verdict: Runtime Error):
h,a=mp(int,input().split());print(h//a+1 if h%a!=0 else h//a)
Problem p02802 (python)

Fixed submission:
n,m=map(int,input().split())

if m==0:
    print(0,0)
    import sys
    sys.exit()

p=[list(input().split()) for _ in range(m)]
correct=set([p[i][0] for i in range(m) if p[i][1]=='AC'])

s=set()
sum_wa=0

for i in [p[j] for j in range(m) if p[j][0] in correct]:
    if i[0] in s:
        continue
    else:
        if i[1]=='WA':
            sum_wa+=1
        else:
            s.add(i[0])

print(len(correct),sum_wa)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
p=[list(input().split()) for _ in range(m)]

correct=[]
data={}

for j in range(m):
    if p[j][0] in correct:
        continue
    if p[j][0] in data.keys():
        if p[j][1]=='WA': 
            data[p[j][0]]+=1
        else:
            correct.append(p[j][0])
    else:
        if p[j][1]=='WA':
            data[p[j][0]]=1
        else:
            correct.append(p[j][0])

#print(correct,data)
#print(len(correct),sum(data.values()))
sum_wa=0
for i in correct:
    sum_wa+=data[i]
#print(sum_wa)
print(len(correct),sum_wa)
Problem p02921 (python)

Fixed submission:
s=input()
t=input()
a=0
for i in range(3):
  if s[i]==t[i]:
    a+=1
print(a)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
i=1
while a+(i-1)*(a-1)<b:
    i+=1
print(i)

Buggy submission (verdict: Runtime Error):
s=input()
t=input()
a=0
for i in range(3)
  if s[i]==t[i]:
    a+=1
print(a)
Problem p02957 (python)

Fixed submission:
a,b=map(int,input().split());print('IMPOSSIBLE' if (b-a)%2!=0 else int((a+b)/2))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input());print('IMPOSSIBLE' if (b-a)%2!=0 else int((a+b)/2))
Problem p03059 (python)

Fixed submission:
a,b,t=map(int,input().split());print(b*(t//a))

Buggy submission (verdict: Runtime Error):
a,b,t=map(int,input().split());print(b*(c//a))
Problem p03136 (python)

Fixed submission:
n,*l=map(int,open(0).read().split())
sum_n=sum(l)
for i in range(n):
	if 2*l[i]>=sum_n:
		print('No')
		import sys
		sys.exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
n,l=map(int,open(0).read().split())
sum_n=sum(l)
for i in range(n):
	if 2*l[i]>=sum_n
		print('No')
		import sys
		sys.exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
n,l=map(int,open(0).read().split())
sum_n=sum(l)
for i in range(n):
  if 2*l[i]>=sum_n
  	print('No')
    import sys
    sys.exit()
print('Yes')
Problem p03292 (python)

Fixed submission:
a,b,c=map(int,input().split())
print(min(abs(b-a)+abs(c-b),abs(c-a)+abs(b-c),abs(a-b)+abs(c-a),abs(c-b)+abs(a-c),abs(a-c)+abs(b-a),abs(b-c)+abs(a-b)))

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print(min(abs(b-a)+abs(c-b),abs(c-a)+abs(b-c),abs(a-b)+abs(c-a),abs(c-b)+abs(a-c),abs(a-c)+abs(b-a),abc(b-c)+abs(a-b)))
Problem p03337 (python)

Fixed submission:
a,b=map(int,input().split());print(max(a+b,a-b,a*b))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split());print(max(a+b,a-b a*b))
Problem p03351 (python)

Fixed submission:
a,b,c,d=map(int,input().split())
print('NYoe s'[abs(a-c)<=d or (abs(b-a)<=d and abs(c-b)<=d)::2])

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input(),split())
print('NYoe s'[abs(a-c)<=d or (abs(b-a)<=d and abs(c-b)<=d)::2])
Problem p03359 (python)

Fixed submission:
a,b=map(int,input().split())
print(a if a<=b else a-1)

Buggy submission (verdict: Runtime Error):
a = list(map(int,input().split()))
a.sort()
k = int(input())
print(a[0]+a[1]+a[2]*(2**k))
Problem p03360 (python)

Fixed submission:
a = list(map(int,input().split()))
a.sort()
k = int(input())
print(a[0]+a[1]+a[2]*(2**k))

Buggy submission (verdict: Runtime Error):
a = list(map(int,input().split())).sort()
k = int(input())
print(a[0]+a[1]+a[2]*(2**k))
Problem p03424 (python)

Fixed submission:
_,*s=map(str,open(0).read().split())
print('TFhoruere'[len(set(s))==4::2])

Buggy submission (verdict: Runtime Error):
n,*s=map(int,open(0).read().split())
print('TFhoruere'[len(set(s))==4::2])
Problem p03547 (python)

Fixed submission:
x,y=input().split()
if ord(x)<ord(y):
  print('<')
elif ord(x)>ord(y):
  print('>')
else:
  print('=')

Buggy submission (verdict: Runtime Error):
x,y=input().split()
if ord(x)<ord(y):
  print('<')
elif prd(x)>ord(y):
  print('>')
else:
  print('=')
Problem p03563 (python)

Fixed submission:
r,g=map(int,open(0).read().split());print(g*2-r)

Buggy submission (verdict: Runtime Error):
r,g=map(int,input().split());print(g*2-r)
Problem p03657 (python)

Fixed submission:
a,b=map(int,input().split())
print('Possible' if (a%3==0 or b%3==0 or (a+b)%3==0) else 'Impossible')

Buggy submission (verdict: Runtime Error):
a,b=mpa(int,input().split())
print('Possible' if (a%3==0 or b%3==0 or a+b%3==0) else 'Impossible')

Buggy submission (verdict: Runtime Error):
print('Possible' if sum(map(int, input()))%3==0 else 'Impossible')

Buggy submission (verdict: Runtime Error):
print('Possible' if sum(list(map(int, input())))%3==0 else 'Impossible')
Problem p03737 (python)

Fixed submission:
a,b,c=map(str,input().split());print((a[0]+b[0]+c[0]).upper())

Buggy submission (verdict: Runtime Error):
a,b,c=map(str,input().split());print((a[0]+b[0]+v[0]).upper())
Problem p03777 (python)

Fixed submission:
a,b=map(str,input().split());print('DH'[a==b::2])

Buggy submission (verdict: Runtime Error):
a,b=map(str,input().split());print('DH'[a==b::2]
Problem p03943 (python)

Fixed submission:
a=list(map(int,input().split()))
a.sort()
print('YNeos'[a[2]!=a[0]+a[1]::2])

Buggy submission (verdict: Runtime Error):
a=map(int,input().split())
a.sort()
print('YNeos'[a[2]!=a[0]+a[1]::2])
Problem p02601 (python)

Fixed submission:
R,G,B=map(int,input().split())
K=int(input())
for _ in range (K) :
    if R < G :
        pass
    else:
        G*=2
        continue

    if G < B :
        pass
    else:
        B*=2
        continue
    
if R < G < B :
    print('Yes')
else :
    print('No')

Buggy submission (verdict: Runtime Error):
R,G,B,K=map(int,input().split())



for _ in range (K) :
    if R < G :
        pass
    else:
        G*=2
        continue

    if G < B :
        pass
    else:
        B*=2
        continue
    
if R < G < B :
    print('Yes')
else :
    print('No')
Problem p03029 (python)

Fixed submission:
L = list(map(int,input().split()))
print((int(L[0]*3+L[1])//2))

Buggy submission (verdict: Runtime Error):
a=int(input())
p=int(input())
print(int((3*a+p)/2))
Problem p02957 (python)

Fixed submission:
a, b = map(int, input().split())
if (a+b)%2 == 0:
	print((a+b)//2)
else:
  	print('IMPOSSIBLE')

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a+b)%2 == 0:
	print((a+b)//2)
else:
  	print(IMPOSSIBLE)
Problem p02993 (python)

Fixed submission:
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
	print('Bad')
else:
  	print('Good')

Buggy submission (verdict: Runtime Error):
n, l = map(int, input().split())
if l>=0:
	print(int(n**2/2+l*n-n/2-l))
if l<0 and n-1<l:
  	print(int(n**2/2+l*n-n/2))
else:
  	print(int((n**2/2)+l*n-n/2-l-n+1))

Buggy submission (verdict: Runtime Error):
n, l = map(int, input().split())
if l>=0:
	print(n**2/2+l*n-n/2-l)
if l<0 and n-1<l:
  	print(n**2/2+l*n-n/2)
else:
  	print((n**2/2)+l*n-n/2-l-n+1)
Problem p03035 (python)

Fixed submission:
a, b = map(int, input().split())
if a>=13:
  print(int(b))
elif 6<=a<=12:
  print(int(b/2))
else:
  print(int(0))

Buggy submission (verdict: Runtime Error):
r,d,x = map(int, input().split())
result=[]
result.append(x)
for i in range(10):
	x=r*x-d
	result.append(x)
for i in result[1:11]:
	print(int(i))

Buggy submission (verdict: Runtime Error):
r,d,x = map(int, input().split())
result=[]
result.append(x)
for i in range(10):
	x=r*x-d
	result.append(x)
for i in result[1:11]:
	print(str(i))

Buggy submission (verdict: Runtime Error):
r,d,x = map(int, input().split())
result=[]
result.append(x)
for i in range(10):
	x=r*x-d
	result.append(x)
for i in result[1:11]:
	print(i)

Buggy submission (verdict: Runtime Error):
r,d,x = map(int, input().split())
result=[]
result.append(x)
for i in range(10):
	x=r*x-d
	result.append(x)
for i in result[1:10]:
	print(i)
Problem p02843 (python)

Fixed submission:
n=int(input())
res=int((n%100)/5)
n -= 105*res
if n == 0 or n >= 100:
    print(1)
else:
    print(0)

Buggy submission (verdict: Runtime Error):
g
Problem p03044 (python)

Fixed submission:
N = int(input())
nlist = []
for i in range(N):
    nlist.append([])
for i in range(N - 1):
    u, v, w = map(int, input().split())
    u -= 1
    v -= 1
    w = (w % 2 == 1)
    nlist[u].append([v, w])
    nlist[v].append([u, w])

color = [-1] * N
color[0] = 0
nextlist = [0]
while nextlist:
    tmp = []
    for proc in nextlist:
        for n in nlist[proc]:
            if color[n[0]] != -1:
                continue
            color[n[0]] = (color[proc] + n[1]) % 2
            tmp.append(n[0])
    nextlist = tmp

for c in color:
    print(c)

Buggy submission (verdict: Runtime Error):
N = int(input())
nlist = []
for i in range(N):
    nlist.append([])
for i in range(N - 1):
    u, v, w = map(int, input().split())
    u -= 1
    v -= 1
    w = (w % 2 == 1)
    nlist[u].append([v, w])
    nlist[v].append([u, w])

color = [-1] * N
def fill(n, val):
    if color[n] != -1:
        return
    color[n] = val
    for nei in nlist[n]:
        fill(nei[0], (val + nei[1]) % 2)
fill(0, 0)

for c in color:
    print(c)
Problem p02694 (python)

Fixed submission:
from math import floor

y = int(input())
x = 100
n = 0
while x < y:
    x += floor(x * 0.01)
    n += 1

print(n)

Buggy submission (verdict: Runtime Error):
from math import floor

def f(x,y,n):
  if x >= y:
    return x
  else:
    n += 1
    x += floor(x*0.01)
    return f(x,y,n)

x = int(input())
print(f(100,x,n))
Problem p02717 (python)

Fixed submission:
a,b,c = map(int,input().split())
print("{} {} {}".format(c,a,b))

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(f"{c} {a} {b}")
Problem p02718 (python)

Fixed submission:
n,m = map(int,input().split())
a = sorted(list(map(int,input().split())),reverse=True)
for i in range(m):
    if a[i] < sum(a)/(4*m):
        print("No")
        exit()
print("Yes")

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = sorted(list(map(int,input().split())),reverse=True)
print("YNeos"[sum([sum(a)/(4*m)<a[i] for i in range(m+1)])<m::2])
Problem p02742 (python)

Fixed submission:
h,w = map(int,input().split())
print((int(h/2+0.5)*w-(h%2)*int(w/2))if(h-1)and(w-1)else 1)

Buggy submission (verdict: Runtime Error):
h,w = map(int,s.split())
print(int(h/2+0.5)*w-(h%2)*int(w/2))
Problem p03547 (python)

Fixed submission:
def c(x):
  return int(x,16)

x, y = map(str,input().split())
x, y = c(x), c(y)
print("="if x==y else"<"if x<y else">")

Buggy submission (verdict: Runtime Error):
x, y = int(input(),16), int(input(),16)
print("="if x==y else "<"if x<y else">")
Problem p03643 (python)

Fixed submission:
print("ABC{0}".format(input()))

Buggy submission (verdict: Runtime Error):
print("ABC{0}".format(intput()))
Problem p02621 (python)

Fixed submission:
n=int(input())
print(n+n*n+n*n*n)

Buggy submission (verdict: Runtime Error):
n=input()
print(n+n*n+n*n*n)
Problem p03455 (python)

Fixed submission:
a, b = map(int, input().split())  
if (a*b) % 2:
    print("Odd")
else:
    print("Even")

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())  
c = a*b
if c/2 = 0
print("Even")
elif c/2 = 1
print("Odd")
Problem p02720 (python)

Fixed submission:
cur = []

def recur(n):
    if n > 10 ** 10:
        return
    cur.append(n)
    for i in range(10):
        if abs(n % 10 - i) <= 1:
            recur(10 * n + i)

for i in range(1, 10):
    recur(i)
cur.sort()
n = int(input())
print((cur[n - 1]))

Buggy submission (verdict: Runtime Error):
cur = []

def recur(n):
    if n > 10 ** 9:
        return
    cur.append(n)
    for i in range(10):
        if abs(n % 10 - i) <= 1:
            recur(10 * n + i)

for i in range(1, 10):
    recur(i)
cur.sort()
n = int(input())
print((cur[n - 1]))
Problem p02727 (python)

Fixed submission:
x, y, a, b, c = map(int, input().split())

red = list(map(int, input().split()))
green = list(map(int, input().split()))
colorless = list(map(int, input().split()))

red.sort(reverse = True)
green.sort(reverse = True)
colorless.sort(reverse = True)

ret = red[:x] + green[:y]
ret.sort()

for i in range(len(colorless)):
    if ret[i] < colorless[i]:
        ret[i] = colorless[i]
    else:
        break

print(sum(ret))

Buggy submission (verdict: Runtime Error):
x, y, a, b, c = map(int, input().split())

red = list(map(int, input().split()))
green = list(map(int, input().split()))
colorless = list(map(int, input().split()))

red.sort(reverse = True)
green.sort(reverse = True)
colorless.sort(reverse = True)

ret = red[:x] + green[:y]
ret.sort()

for i in range(len(colorless)):
    if ret[i] < colorless[i]:
        ret[i] = colorless[i]

print(sum(ret))
Problem p02778 (python)

Fixed submission:

s = str(input())
print(len(s) * "x")

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

print(len(input()) * 'X)
Problem p02900 (python)

Fixed submission:
import sys
import math
from fractions import gcd

input = sys.stdin.readline

def prime(n):
    primes = {}
    bound = int(math.sqrt(n)) + 1
    for i in range(2, bound):
        while n % i == 0:
            n //= i
            if not i in primes.keys():
                primes[i] = 1
            else:
                primes[i] += 1
    if n != 1:
        if n not in primes.keys():
            primes[n] = 1
        else:
            primes[n] += 1
    return primes

A, B = map(int, input().split())
g = gcd(A, B)
cur = prime(g)
print(len(cur) + 1)

Buggy submission (verdict: Runtime Error):
import sys
import math
from math import gcd

input = sys.stdin.readline

def prime(n):
    primes = {}
    bound = int(math.sqrt(n)) + 1
    for i in range(2, bound):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                n //= i
                if not i in primes.keys():
                    primes[i] = 1
                else:
                    primes[i] += 1
    if n != 1:
        if not n in primes.keys():
            primes[n] = 1
        else:
            primes[n] += 1
    return primes

A, B = map(int, input().split())
g = gcd(A, B)
print(len(prime(g)) + 1)

Buggy submission (verdict: Runtime Error):
import sys
import math
from math import gcd

input = sys.stdin.readline

def prime(n):
    primes = {}
    bound = int(math.sqrt(n)) + 1
    for i in range(2, bound):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                n //= i
                if not i in primes.keys():
                    primes[i] = 1
                else:
                    primes[i] += 1
    if n != 1:
        if not n in primes.keys():
            primes[n] = 1
        else:
            primes[n] += 1
    return primes

A, B = map(int, input().split())
g = gcd(A, B)
print(len(prime(g)) + 1)
Problem p02583 (python)

Fixed submission:
import itertools
n = int(input())
data = list(map(int, input().split()))
data1=sorted(data)
a = list(itertools.combinations(data1,3))
ans=0
for m in range(len(a)):
  if a[m][0]!=a[m][1] and a[m][1]!=a[m][2]:
    if a[m][0]+a[m][1]>a[m][2]:
      ans=ans+1
print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
array=list(map(int,input().split()))
array1=sorted(array)
import itertools
list1=list(itertools.combinations(array1,3))
ans=0
for n in range(len(list1)):
  if list[n][0]!=list[n][1] and list[n][1]!=list[n][2]:
    if list[n][0]+list[n][1]>list[n][2]:
      ans=ans+1
print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
array=list(map(int,input().split()))
array.sort()
import itertools
list1=list(itertools.combinations(array,3))
ans=0
for n in range(len(list1)):
  if list[n][0]!=list[n][1] and list[n][1]!=list[n][2]:
    if list[n][0]+list[n][1]>list[n][2]:
      ans=ans+1
print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
array=list(map(int,input().split()))
array1=array.sort()
import itertools
list1=list(itertools.combinations(array1,3))
ans=0
for n in range(len(list1)):
  if list[n][0]!=list[n][1] and list[n][1]!=list[n][2]:
    if list[n][0]+list[n][1]>list[n][2]:
      ans=ans+1
print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
array=list(map(int,input().split()))
array1=array.sort()
import itertools
list1=itertools.combinations(array1,3)
ans=0
for n in range(len(list1)):
  if list[n][0]!=list[n][1] and list[n][1]!=list[n][2]:
    if list[n][0]+list[n][1]>list[n][2]:
      ans=ans+1
print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
array=list(map(int,input()))
array1=array.sort()
import itertools
list1=itertools.combinations(array1,3)
ans=0
for n in range(len(list1)):
  if list[n][0]!=list[n][1] and list[n][1]!=list[n][2]:
    if list[n][0]+list[n][1]>list[n][2]:
      ans=ans+1
print(ans)

Buggy submission (verdict: Runtime Error):
n=input()
array=list(map(int,input()))
array1=array.sort()
import itertools
list1=itertools.combinations(array1,3)
ans=0
for n in range(len(list1)):
  if list[n][0]!=list[n][1] and list[n][1]!=list[n][2]:
    if list[n][0]+list[n][1]>list[n][2]:
      ans=ans+1
print(ans)
Problem p02600 (python)

Fixed submission:
a=int(input())
if 400<=a<=599:
  print(8) 
if 600<=a<=799:
  print(7)
if 800<=a<=999:
  print(6)
if 1000<=a<=1199:
  print(5)
if 1200<=a<=1399:
  print(4)
if 1400<=a<=1599:
  print(3)
if 1600<=a<=1799:
  print(2)
if 1800<=a<=1999:
  print(1)

Buggy submission (verdict: Runtime Error):
a=int(input())
print(8) if 400<=a<=599
print(7) if 600<=a<=799
print(6) if 800<=a<=999
print(5) if 1000<=a<=1199
print(4) if 1200<=a<=1399
print(3) if 1400<=a<=1599
print(2) if 1600<=a<=1799
print(1) if 1800<=a<=1999

Buggy submission (verdict: Runtime Error):
a=int(input())
print(8 if 400 <= a <= 599)
print(7 if 600 <= a <= 799)
print(6 if 800 <= a <= 999)
print(5 if 1000 <= a <= 1199)
print(4 if 1200 <= a <= 1399)
print(3 if 1400 <= a <= 1599)
print(2 if 1600 <= a <= 1799)
print(1 if 1800 <= a <= 1999)

Buggy submission (verdict: Runtime Error):
a=int(input())
print('8' if 400 <= a <= 599)
print('7' if 600 <= a <= 799)
print('6' if 800 <= a <= 999)
print('5' if 1000 <= a <= 1199)
print('4' if 1200 <= a <= 1399)
print('3' if 1400 <= a <= 1599)
print('2' if 1600 <= a <= 1799)
print('1' if 1800 <= a <= 1999)

Buggy submission (verdict: Runtime Error):
a=int(input())
print('8') if 400<=a<=599
print('7') if 600<=a<=799
print('6') if 800<=a<=999
print('5') if 1000<=a<=1199
print('4') if 1200<=a<=1399
print('3') if 1400<=a<=1599
print('2') if 1600<=a<=1799
print('1') if 1800<=a<=1999