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

Fixed submission:
if __name__ == "__main__":
    s = str(input())

    ans= 0

    for c in s:
        if c == '-':
            ans = ans - 1
        if c == '+':
            ans = ans + 1

    print(ans)

Buggy submission (verdict: Runtime Error):
if __name__ == "__main__":
    s = str(input())
    
    ans= 0
    
    for c in s:
        if c == '-':
            ans = ans - 1
        if c == '+'
            ans == ans + 1
            
    print(ans)
Problem p03317 (python)

Fixed submission:
import math
N, K = map(int, input().split())
input()
     
print(math.ceil((N-1)/(K-1)))

Buggy submission (verdict: Runtime Error):
from math import ceil
N, K = map(int, raw_input().split())
A = map(int, raw_input().split())

print (int(ceil((N-1)/(K-1))))

Buggy submission (verdict: Runtime Error):
from math import ceil
N, K = map(int, raw_input().split())
A = map(int, raw_input().split())

print (ceil((N-1)/(K-1)))

Buggy submission (verdict: Runtime Error):
from math import ceil
N, K = map(int, raw_input().split())
A = map(int, raw_input().split())

print (ceil((N-1)//(K-1)))

Buggy submission (verdict: Runtime Error):
from math import ceil
N, K = map(int, raw_input().split())
A = map(int, raw_input().split())

print (ceil(N - 1 // K - 1))
Problem p03315 (python)

Fixed submission:
s = input()
i = s.count("+")

print(2 * i - 4)

Buggy submission (verdict: Runtime Error):
n = input()
s = 0
for i in range(len(n)) :
    s += int(n[i])
n = int(n)
if n % s == 0 :
    print('Yes')
else :
    print('No')

Buggy submission (verdict: Runtime Error):
s = input()
a = 0
for i in range(len(s)):
    a += int(s[i])
s = int(s)
if s % a == 0 :
    print('Yes')
else :
    print('No')

Buggy submission (verdict: Runtime Error):
s = input()
a = 0
for i in range(len(s)):
    a += int(s[i])
s = int(s)
if s % a = 0 :
    print('Yes')
else :
    print('No')
Problem p03317 (python)

Fixed submission:
import math
a, b = map(int, input().split())
d = (a-1) / (b-1)
print(math.ceil(d))

Buggy submission (verdict: Runtime Error):
import math
a, b = map(int, input().split())
c = b - 1

d = a / c

print(math.ceil(d)
Problem p03327 (python)

Fixed submission:
a = int(input())

if a < 1000 :
    print("ABC")
else :
    print("ABD")

Buggy submission (verdict: Runtime Error):
a = input()

if a < 1000 :
    print("ABC")
else :
    print("ABD")
Problem p03803 (python)

Fixed submission:

def one(x):
    if x == 1:
        ret = 14
        return ret
    else:
        ret = x
        return ret

a, b = map(int, input().split())
if one(a) > one(b):
    print("Alice")
elif one(a) < one(b):
    print("Bob")
else:
    print("Draw")

Buggy submission (verdict: Runtime Error):

def one(x):
    if x == 1:
        ret = 14
        return ret
    else:
        ret = x
        return ret

a, b = map(int, int(input())
if one(a) > one(b):
    print("Alice")
elif one(a) < one(b):
    print("Bob")
else:
    print("Draw")

Buggy submission (verdict: Runtime Error):
a, b = map(input().split())
if a > b:
    print("Alice")
elif a < b:
    print("Bob")
else:
    print("Draw")
Problem p03315 (python)

Fixed submission:
a = 0
S = list(input())

for b in range(4):
    if S[b] == '+':
        a+=1
    elif S[b] == '-':
        a-=1
print(a)

Buggy submission (verdict: Runtime Error):
a = 0
S = input().split()

for b in range(4):
    if S[b] == '+':
        a+=1
    elif S[b] == '-':
        a-=1
print(a)
Problem p03315 (python)

Fixed submission:
S = input()
S = list(S)

A = 0

for i in range(4):
    if S[i] == '+':
        A = A + 1
    elif S[i] == '-':
        A = A - 1

print(A)

Buggy submission (verdict: Runtime Error):
ALL = input().split()
N = int(ALL[0])
K = int(ALL[1])

if (N - K) % (K - 1) == 0:
    answer = (N - K) // (K - 1) + 1
else:
    answer = (N - K) // (K - 1) + 2

print(answer)
Problem p03315 (python)

Fixed submission:
S = input()
x = 0
for c in S:
    if c == "+":
        x += 1
    else:
        x -= 1
print(x)

Buggy submission (verdict: Runtime Error):
import math
N,K = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1)))
Problem p03315 (python)

Fixed submission:
def main(S):
    charlist = list(S)
    out = 0
    for c in charlist:
        if(c=='+'): 
            out = out + 1
        else:  
            out = out - 1
    print(out)
S = input()
main(S)

Buggy submission (verdict: Runtime Error):
def digitsums(N):
    digsum = 0
    for i in range(len(str(N))):
        digsum = digsum + int(N % 10)
        N = N / 10
    return digsum
K = int(input())
pcount=0
for n in range(1,10**15):
    for m in range(n+1,10**15):
        if(n/digitsums(n)<=m/digitsums(m)):
            pcount = pcount+1
            print(n)
            break
    if(pcount>=K):
        break

Buggy submission (verdict: Runtime Error):
def main(S):
    charlist = list(S)
    out = 0
    for c in charlist:
        if(c=='+'): 
            out = out + 1
        else:  
            out = out - 1
    print(out)
S = raw_input()
main(S)
Problem p03315 (python)

Fixed submission:
S= map(str, input().split()) 
b=list(S)

a=0


for i in range(len(b[0])):
	

	if b[0][i] is "+":
		a+=1

	if b[0][i] is "-":
		a-=1




print(a)

Buggy submission (verdict: Runtime Error):
S= input().split() 
 

a=0
 
sum=0
for i in S[0]:
	
	sum=sum+int(i)
 
 
 
anser=int(S[0])%sum
 
 
 
 
 
 
if anser == 0:
	print("Yes")
 
else : print("No")
Problem p03315 (python)

Fixed submission:
result = 0
s = input()

for i in s:
    if i == '+':
        result = result + 1
    else:
        result = result - 1

print(result)

Buggy submission (verdict: Runtime Error):
N = input()
if N == '0':
    print('yes')
else:
    if N[0] == '-':
        N = int(N) * (-1)
    sum = 0
    for i in N:
        sum = sum + int(i)
    r = int(N) % sum
    if r == 0:
        print('yes')
    else:
        print('no')

Buggy submission (verdict: Runtime Error):
result = 0
s = input()
for i in s:
    if i == ‘+’:
        result = result + 1
    else:
        result = result - 1
print(result)

Buggy submission (verdict: Runtime Error):
r = 0
s = input()
for a in s:
    if a == “+”:
        r += 1
    else:
        r -= 1
return r
Problem p03315 (python)

Fixed submission:
input_str = input()
num = 0
for str in input_str:
    if str == '+':
        num += 1
    else:
        num -= 1
print(num)

Buggy submission (verdict: Runtime Error):
input_str = int(input())
num = 0
for str in input_str:
    if str == '+':
        num += 1
    else:
        num -= 1
print(num)
Problem p03329 (python)

Fixed submission:
N = int(raw_input())
p = [1]
for j in [6, 9]:
  i = j
  while i <= N:
    p.append(i)
    i *= j
c = [N] * (N+1)
c[0] = 0
for i in range(0, N+1):
  for j in p:
    if i+j <= N:
      c[i+j] = min(c[i+j], c[i]+1)
print c[N]

Buggy submission (verdict: Runtime Error):
N = int(raw_input())                                                                                                                                                                p = [1]                                                                                                                                                                             for j in [6, 9]:                                                                                                                                                                      i = j                                                                                                                                                                               while i < N:
    p.append(i)
    i *= j
c = [N] * (N+1)
c[1] = 1
for i in range(1, N+1):
  for j in p:
    if i+j <= N:
      c[i+j] = min(c[i+j], c[i]+1)
print c[N]
Problem p03326 (python)

Fixed submission:
N,M=map(int,input().split(' '))

x=[]
y=[]
z=[]
for _ in range(N):
  _x,_y,_z=map(int,input().split(' '))
  x.append(_x)
  y.append(_y)
  z.append(_z)

def argmin(l):
  m=min(l)
  for i in range(len(l)):
    if l[i]==m:
      return i

def f(sign_x, sign_y, sign_z):
  l=[]
  for i in range(N):
    s=x[i]*sign_x + y[i]*sign_y + z[i]*sign_z
    l.append(s)
    if len(l)>M:
      del l[argmin(l)]
  return sum(l)


res=0
for x_s in [1,-1]:
  for y_s in [1,-1]:
    for z_s in [1,-1]:
      score = f(x_s, y_s, z_s)
      if score>res:
        res=score

print(res)

Buggy submission (verdict: Runtime Error):
N,M=map(int,input().split(' '))

x=[]
y=[]
z=[]
for _ in range(N):
  _x,_y,_z=map(int,input().split(' '))
  x.append(_x)
  y.append(_y)
  z.append(_z)

def argmin(l):
  m=min(l)
  for i in range(len(l)):
    if l[i]==m:
      return i
  return i

def f(sign_x, sign_y, sign_z):
  l=[]
  for i in range(N):
    s=x[i]*sign_x + y[i]*sign_y + z[i]*sign_z
    if len(l)<M:
      l.append(s)
    elif min(l)<s:
      del l[argmin(l)]
      l.append(s)
  return sum(l)


res=0
for x_s in [1,-1]:
  for y_s in [1,-1]:
    for z_s in [1,-1]:
      score = f(x_s, y_s, z_s)
      if score>res:
        res=score

print(res)

Buggy submission (verdict: Runtime Error):
N,M=map(int,input().split(' '))

x=[]
y=[]
z=[]
for _ in range(N):
  _x,_y,_z=map(int,input().split(' '))
  x.append(_x)
  y.append(_y)
  z.append(_z)

def argmin(l):
  m=min(l)
  for i in range(len(l)):
    if l[i]==m:
      return i

def f(sign_x, sign_y, sign_z):
  l=[]
  for i in range(N):
    s=x[i]*sign_x + y[i]*sign_y + z[i]*sign_z
    if len(l)<M:
      l.append(s)
    elif min(l)<s:
      del l[argmin(l)]
      l.append(s)
  return sum(l)



res=0
for x_s in [1,-1]:
  for y_s in [1,-1]:
    for z_s in [1,-1]:
      score = f(x_s, y_s, z_s)
      if score>res:
        res=score

print(res)
Problem p03464 (python)

Fixed submission:
import math
K=int(input())
A_lst=[int(_) for _ in input().split() ]

failed=False
if A_lst[-1]!=2:
    failed=True
else:
    stt, end=2,4
    for a in A_lst[-2::-1]:
        #print(stt, end, a)
        stt=a*math.ceil(stt/a)
        if stt>= end:
            failed=True
            break
        end=a*math.ceil(end/a)

if failed:
    print(-1)
else:
    print(stt, end-1)

Buggy submission (verdict: Runtime Error):
import math
K=int(input())
A_lst=[int(_) for _ in input().split() ]

assert A_lst[-1]==2
stt, end=2,4
failed=False
for a in A_lst[-2::-1]:
    #print(stt, end, a)
    stt=a*math.ceil(stt/a)
    if stt>= end:
        failed=True
        break
    end=a*math.ceil(end/a)

if failed:
    print(-1)
else:
    print(stt, end-1)
Problem p03327 (python)

Fixed submission:
input_data = int(input())
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Buggy submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print(str(ABC))
else:
    print(str(ABD))

Buggy submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print(ABC)
else:
    print(ABD)

Buggy submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Buggy submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print('ABC')
print('ABD')
Problem p03327 (python)

Fixed submission:
N = input()
N=int(N)
if N>=1 and N<=999:
    print('ABC')
if N>=1000 and N<=1998:
    print('ABD')

Buggy submission (verdict: Runtime Error):
N = input()
N=int(N)
if N>=1,N<=999:
    print('ABC')
if N>=1000,N<=1998:
    print('ABD')

Buggy submission (verdict: Runtime Error):
N = int(input())
if N>=1,N<=999:
    print('ABC')
if N>=1000,N<=1998:
    print('ABD')

Buggy submission (verdict: Runtime Error):
N = int(input())
if N>=1,N<=999:
    print('ABC')
if N>=1000,N<=1998
    print('ABD')
Problem p03327 (python)

Fixed submission:
N = int(input())
if N >= 1000:
    print('ABD')
else:
    print('ABC')

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
b_index = b-a
a_index = b_index - 1
get_height = lambda n: n*(n+1)/2

a_height = get_height(a_index)
b_height = get_height(b_index)
snow_height = b_height - b
print(int(snow_height))
Problem p03835 (python)

Fixed submission:
k, s = map(int, input().split())

count = 0

for x in range(k+1):
    for y in range(k+1):
        z = s-x-y
        if z >= 0 and z <= k:
            count += 1

print(count)

Buggy submission (verdict: Runtime Error):
k, s = map(int, input().split())

x, y, z = 0, 0, 0

an = s - (k * 2)
bn = s - k

if an >= 0:
    x = k - an + 1
    step = 1
    start = 0
    for i in range(x):
        start += step
        step += 1
elif bn >= 0:
    step = 1
    start = 0
    for i in range(k+1):
        start += step
        step += 1

print(start)
Problem p03327 (python)

Fixed submission:
#coding : utf-8

if __name__ == '__main__':

    N = int(input())
    if N < 1000:
        print('ABC')
    else:
        print('ABD')

Buggy submission (verdict: Runtime Error):
#coding : utf-8

if __name__ == '__main__':

    N = int(input())
    if n < 1000:
        print('ABC')
    else:
        print('ABD')
Problem p03327 (python)

Fixed submission:
line = input();

if(line < 1000):
    print('ABC');
else:
    print('ABD');

Buggy submission (verdict: Runtime Error):
while(True):
    line = input();

    if(line < 1000):
        print('ABC');
    else:
        print('ABD');

Buggy submission (verdict: Runtime Error):
#coding : utf8

while(True):
    line = input();

    if(line < 1000):
        print('ABC');
    else:
        print('ABD');

Buggy submission (verdict: Runtime Error):
#coding : utf8

number = input();
if(number < 1000):
    print('ABC');
else:
    print('ABD');
Problem p03631 (python)

Fixed submission:
n = list(map(int,input()))
if n[0]==n[2]: print('Yes')
else: print('No')

Buggy submission (verdict: Runtime Error):
n = int(input().split())
if n[0]==n[2]: print('Yes')
else: print('No')
Problem p03327 (python)

Fixed submission:
n = int(input())
def con_n(n):
    if n < 1000:
        return 'ABC'
    elif n >= 1000:
        return 'ABD'
    
print(con_n(n))

Buggy submission (verdict: Runtime Error):
k, l=[int(i) for i in input().split()]

import numpy as np
n = np.zeros(999)
for i in range(1000):
    if i != 0:
        n[i-1] = i


def snowh(k, l):
    for i in range(1000):
        if l-k == n[i-1]:
            return n[i-2]*(n[i-2]+1)*0.5 - k
        
print(snowh(k, l))

Buggy submission (verdict: Runtime Error):
n = int(input())
def con_n(n):
    if n < 1000:
        return 'ABC'
    elif n => 1000:
        return 'ABD'
    
print(con_n(n))

Buggy submission (verdict: Runtime Error):
n = int(input())
def con_n(n):
    if n < 1000:
        return 'ABC'
    elif n => 1000:
        return 'ABD'
    
print(con_n(n))
Problem p03327 (python)

Fixed submission:
n = int(input())
if(n <= 999):
    print('ABC')
else:
    print('ABD')

Buggy submission (verdict: Runtime Error):
n = int(input())
if(n <= 999):
    print('ABC' + n)
else:
    print('ABD' + n)
Problem p03803 (python)

Fixed submission:
a,b = map(int,input().split())
if a == 1:
    a = 14
if b == 1:
    b = 14
if a == b:
    print("Draw")
elif a < b:
    print("Bob")
else:
    print("Alice")

Buggy submission (verdict: Runtime Error):
if a == b:
    print("Draw")
elif a > b and b != 1:
    print("Alice")
elif b == 1 and a > b:
    print("Bob")
elif a == 1 and b > a:
    print("Alice")
else:
    print("Bob")
Problem p03327 (python)

Fixed submission:
N = int(input())

if N < 1000:
    print("ABC")
else:
    print("ABD")

Buggy submission (verdict: Runtime Error):
a,b = [int(i) for i in input().split()]

step = 2
towers = [1]
i = 1
while True:
    towers.append(towers[i-1] + step)
    
    if towers[i] >= 499500:
        break
    i += 1
    step += 1


depth = towers[(b-a)-1] - b
print(depth)
Problem p03803 (python)

Fixed submission:
a,b = list(int(i) for i in input().split())
if a == 1:
    a = 14
if b == 1:
    b = 14
if a==b:
    print("Draw")
else:
    print("Alice" if a>b else "Bob")

Buggy submission (verdict: Runtime Error):
from sys import stdin, setrecursionlimit
setrecursionlimit(5000)
def readLine_int_list():return list(map(int, stdin.readline().split()))
def readAll_int(): return list(list(map(int,i.split())) for i in stdin.read().split("\n"))
 
 
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def ratio(a,b):
    return (a//gcd(a,b), b//gcd(a,b))
 
def add_ratio(a,b):
    if a != 0:
        sum_a = sum(a)
        sum_b = sum(b)
        _a = a[0]*sum_b + b[0]*sum_a
        _b = b[1]*sum_a + a[1]*sum_b
        return ratio(_a, _b)
    else:
        return(b)
 
def dfs(i, v, r,ans):
    if i == n:
        if r == (Ma,Mb):
            ans.append(v)
        return 0

    if dfs(i+1, v, r,ans):
        return 0
    
    if dfs(i+1, v+D[i][2], add_ratio(r,ratio(D[i][0],D[i][1])), ans):
        return 0
 
    return 0
ans = []
n, Ma, Mb = readLine_int_list()
D = readAll_int()
e=0
for i in D:
    e += i[2]

def main():
    dfs(0,0,0,ans)
    if ans:
        print(min(ans))
    else:
        print(-1)
 
if __name__ == "__main__":
    main()
Problem p03834 (python)

Fixed submission:
from sys import stdin, stdout
def readLine_str_list():return list(map(str, stdin.readline().split(',')))
def main():
    s = readLine_str_list()
    print(' '.join(s))

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
def readLine_str_list():return list(map(str, stdin.readline().split(',')))
def main():
    s = readLine_str_list()
    print(' '.join(s))

if __name__ == "__main__":
    main()
Problem p03805 (python)

Fixed submission:
from itertools import permutations

def f(n, m, uu, vv):
    a = [[0] * n for _ in range(n)]
    for u, v in zip(uu, vv):
       
        a[u][v] = 1
        a[v][u] = 1
 
    res = 0
    for p in permutations(range(n)):
        if p[0] != 0:
            break
     
        ok = True
        for i in range(n-1):
            if a[p[i]][p[i+1]] == 0:
                ok = False
                break
        if ok:
            res += 1
    return res


n,m = map(int,input().split())
a = []
b = []

for i in range(m):
    _a, _b = map(int, input().split())
    _a -= 1
    _b -= 1
    a.append(_a)
    b.append(_b)

print(f(n, m, a, b))

Buggy submission (verdict: Runtime Error):
from itertools import permutations

def f(n, m, uu, vv):
    a = [[0] * n for _ in range(n)]
    for u, v in zip(uu, vv):
        a[u][v] = 1
        a[v][u] = 1
    res = 0
    for p in permutations(range(n)):
        if p[0] != 0:
            break
        ok = True
        for i in range(n-1):。
            if a[p[i][p[i+1]] == 0:
                ok = False
                break
        if ok:
            res += 1
    return res


n,m = map(int,input().split())
a = []
b = []
for i in range(m):
    _a, _b = map(int, input().split())
    _a -= 1
    _b -= 1
    a.append(_a)
    b.append(_b)

print(f(n, m, a, b))
Problem p03327 (python)

Fixed submission:
number = int(input())

if number > 0 and number < 1000:
    print("ABC")

if number >= 1000 and number <= 1998:
    print("ABD")

Buggy submission (verdict: Runtime Error):
number = input()

if number > 0 and number < 1000:
    print("ABC")

if number >= 1000 and number <= 1998:
    print("ABD")
Problem p03327 (python)

Fixed submission:
N = int(input())
if N < 1000:
    print('ABC')
elif N >= 1000:
    print('ABD')

Buggy submission (verdict: Runtime Error):
a,b = [int(i) for i in input().split()]
n = b-a-1
print(int(n*(n+1)/2-a))

Buggy submission (verdict: Runtime Error):
a,b = [int(i) for i in input().split()]
n = b-a-1
print(n*(n+1)/2-a)
Problem p03327 (python)

Fixed submission:
a = input()
b = int(a)
if b < 1000 :
    print "ABC"
else: 
    print "ABD"

Buggy submission (verdict: Runtime Error):
a = input()
b = int(a)
if b < 1000 :
    print "ABC"
else:
    print "ABD"
Problem p03329 (python)

Fixed submission:
N = int(input())
count = 0
ans = []
for i in range(N+1):
    count1 = 0
    count2 = 0
    N1 = N - i
    x = i
    while x:
        count1 += x % 6
        x //= 6
    while N1:
        count2 += N1 % 9
        N1 //= 9
    count = count1 + count2
    ans.append(count)
print(min(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
count = 0
ans = []
for i in range(N+1):
    count1 = 0
    count2 = 0
    N1 = N - i
    x = i
    while x:
        count1 += x % 6
        x //= 6
    while N1
        count2 += N1 % 9
        N1 //= 9
    count = count1 + count2
    ans.append(count)
print(min(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
count = 0
ans = []
for i in range(N+1):
    count1 = 0
    count2 = 0
    N1 = N - i
    x = i
    while x:
        count1 += x % 6
        x //= 6
    while N1
        count2 += x % 9
        N1 //= 9
    count = count1 + count2
    ans.append(count)
print(min(ans))
Problem p03327 (python)

Fixed submission:
N = int(input())
if N <= 999:
    print("ABC")
else:
    print("ABD")

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
C = (B - A )*( B - A + 1 )/ 2 - B 
print(C)
Problem p03327 (python)

Fixed submission:
num = int(input())
if num < 1000:
   print('ABC')
else:
   print('ABD')

Buggy submission (verdict: Runtime Error):
num = input()
if num < 1000:
  print('ABC')
else:
  print('ABD')
Problem p03327 (python)

Fixed submission:
a = int(input())
if a>=1000:
    print("ABD")
else:
    print("ABC")

Buggy submission (verdict: Runtime Error):
a,b = [int(i) for i in input().split(' ')]
n=b-a#13-8=5
N=n-1#5-1=4
x=(1/2*N)*(N+1)#2*5=10
y= x - a#10-8=2
print(int(y))

Buggy submission (verdict: Runtime Error):
a = int(input())
if a>=999:
    print("ABD")
 else:
    print("ABC")
Problem p03327 (python)

Fixed submission:
# -*- coding: utf-8 -*-
n = int(input())

if n < 1000:
    print('ABC')
else:
    print('ABD')

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*
a_b = input().split()
a = int(a_b[0])
b = int(a_b[1])
n = b - a

h = (n - 1) * n / 2 - a

print(int(h))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())

if n < 1000:
    print(ABC)
else:
    print(ABD)
Problem p03803 (python)

Fixed submission:
a, b = map(int, input().split())
if a == 1 :
    a = 14
if b == 1 :
    b = 14
if a > b :
    print ('Alice')
elif a < b :
    print('Bob')
else :
    print('Draw')

Buggy submission (verdict: Runtime Error):
, b = map(int, input().split())
if a == 1 :
    a = 14
if b == 1 :
    b = 14
if a > b :
    print ('Alice')
elif a < b :
    print('Bob')
else :
    print('Draw')
Problem p03327 (python)

Fixed submission:
suuzi = int(raw_input())
 
if suuzi <= 999:
	print("ABC")
elif suuzi >= 1000:
	print("ABD")

Buggy submission (verdict: Runtime Error):
suuzi = int(input())

if a < 1000:
    print("ABC")
else:
    print("ABD")

Buggy submission (verdict: Runtime Error):
suuzi = input(u">")
 
if suuzi <= 999:
	print u"ABC"
elif suuzi >= 1000:
	print u"ABD"

Buggy submission (verdict: Runtime Error):
# -*- coding:utf-8 -*-
 
suuzi = input(">>>")
 
if suuzi <= 999:
	print u"ABC"
elif suuzi >= 1000:
	print u"ABD"

Buggy submission (verdict: Runtime Error):
# -*- coding:utf-8 -*-

int = input(">>>")

if int <= 999:
    print u"ABC"
elif int >= 1000:
    printu"ABD"
Problem p03327 (python)

Fixed submission:
N = int(input())

if (N>999): print("ABD")
else: print("ABC")

Buggy submission (verdict: Runtime Error):
N = int(input())

if (N>999): print("ABD")
else; print("ABC")