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

Fixed submission:
# n = int(input())
N, K = map(int, input().split())
A = list(map(int, input().split()))
# d = [list(map(int, input().split())) for _ in range(n)]
# s = input()

if (N-1)%(K-1):
    ans =(N-1)//(K-1)+1
else:
    ans = (N-1) // (K - 1)


print(ans)


# K = int(input())

Buggy submission (verdict: Runtime Error):

K = int(input())
aaa = 1
ans_array = []

def sunuke(n):
    re = 0
    tmp = n
    while n:
        re += n % 10
        n = n//10
    re = tmp/re
    print(re)

def print_sunuke():
    global aaa
    num = aaa % 10
    if num == 0:
        aaa += 1
        print_sunuke()
        return
    nine = aaa // 10
    ans = str(num) + "9" * nine
    aaa += 1
    ans_array.append(int(ans))




for i in range(10000):

    print_sunuke()

ans_array.append(1899)
ans_array.append(2899)
ans_array.append(3899)
ans_array.append(4899)
ans_array.append(5899)
ans_array.append(6899)
ans_array.append(7899)
ans_array.append(8899)
ans_array.append(9899)
ans_array.append(18999)
ans_array.append(28999)
ans_array.append(38999)
ans_array.append(48999)
ans_array.append(58999)
ans_array.append(68999)
ans_array.append(78999)
ans_array.append(88999)
ans_array.append(98999)
ans_array.append(189999)
ans_array.append(289999)
ans_array.append(389999)
ans_array.append(489999)
ans_array.append(589999)
ans_array.append(689999)
ans_array.append(789999)
ans_array.append(889999)
ans_array.append(989999)
ans_array.append(1899999)
ans_array.append(2899999)
ans_array.append(3899999)
ans_array.append(4899999)
ans_array.append(5899999)
ans_array.append(6899999)
ans_array.append(7899999)
ans_array.append(8899999)
ans_array.append(9899999)

ans_array.append(18999999)
ans_array.append(28999999)
ans_array.append(38999999)
ans_array.append(48999999)
ans_array.append(58999999)
ans_array.append(68999999)
ans_array.append(78999999)
ans_array.append(88999999)
ans_array.append(98999999)

ans_array.append(189999999)
ans_array.append(289999999)
ans_array.append(389999999)
ans_array.append(489999999)
ans_array.append(589999999)
ans_array.append(689999999)
ans_array.append(789999999)
ans_array.append(889999999)
ans_array.append(989999999)
ans_array.append(1899999999)
ans_array.append(2899999999)
ans_array.append(3899999999)
ans_array.append(4899999999)
ans_array.append(5899999999)
ans_array.append(6899999999)
ans_array.append(7899999999)
ans_array.append(8899999999)
ans_array.append(9899999999)

ans_array.append(18999999999)
ans_array.append(28999999999)
ans_array.append(38999999999)
ans_array.append(48999999999)
ans_array.append(58999999999)
ans_array.append(68999999999)
ans_array.append(78999999999)
ans_array.append(88999999999)
ans_array.append(98999999999)


ans_array.sort()

for i in range(K):
    print(ans_array[i])
Problem p03433 (python)

Fixed submission:
N = int(input())
A = int(input())

if(N%500 <= A):
    print("Yes")
else:
    print ("No")

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

if(n%500 <= A):
    print("Yes")
else:
    print ("No")
Problem p03435 (python)

Fixed submission:
c = [[int(i) for i in input().split()] for j in range(3)]

a = [0 for i in range(3)]
b = [0 for i in range(3)]

a[0] = 0

b[0] = c[0][0]
b[1] = c[0][1]
b[2] = c[0][2]
a[1] = c[1][0] - b[0]
a[2] = c[2][0] - b[0]

if a[1] + b[0] == c[1][0] and a[2] + b[0] == c[2][0] and a[1] + b[1] == c[1][1] and a[2] + b[1] == c[2][1] and a[1] + b[2] == c[1][2] and a[2] + b[2] == c[2][2]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
1 8 6
2 9 7
0 7 7
Problem p03071 (python)

Fixed submission:
A,B=map(int,input().split())
num_an=0
for i in range(2):
  if A>B:
    num=A
    num_an+=num
    A+=-1
  else:
    num=B
    num_an+=num
    B+=-1
print(num_an)

Buggy submission (verdict: Runtime Error):
N=int(input())
H=list(map(int,input().split()))
num_an=1
tmp=H[0]
for i in range(len(H)-1):
	if tmp>=H[i+1]:
		num_an+=1
	else:
		tmp=H[i+1]
print(num_an)
Problem p03043 (python)

Fixed submission:
import math
N,K=map(int,input().split())
sum=0
for i in range(1,N+1):
  if i>=K:
    sum=sum+(1/N)
  else:
    sum=sum+(1/N)*((1/2)**(math.ceil(math.log2(K/i))))
print(sum)

Buggy submission (verdict: Runtime Error):
import math
N,K=map(int,input().split())
sum=0
for i in range(1,N+1):
  if i>=K:
    sum=sum+(1/N)
  else:
    sum=sum+(1/N)*((1/2)**(math.ceil(math.log2(K/i)))
print(sum)
Problem p03359 (python)

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

if a<=b:
    print(a)
else:
    print(a-1)

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

max=a
if b>max:
    max=b
if c>max:
    max=c
sum=a+b+c-max
for i in range(K):
    max*=2
print(sum+max)
Problem p03268 (python)

Fixed submission:
def getIntList():
    return list(map(int, input().split()))    
 
N, K = getIntList()
 
res = 0
c1 =0
c2 =0
if K %2 ==0:
    t = K//2
else:
    t= -1
 
if True:
    for i in range(1,N+1):
        if i%K == t:
            c1+=1
        if i%K ==0:
            c2+=1
res =  c1 **3 + c2** 3
print(res)

Buggy submission (verdict: Runtime Error):

def getIntList():
    return list(map(int, input().split()))    

N, K = getIntList()

res = 0
c1 ==0
c2 ==0
if K %2 ==0:
    t = K//2
else:
    t= -1

if True:
    for i in range(1,N+1):
        if i%K == t:
            c1+=1
        if i%K ==0:
            c2+=1
res =  c1 **3 + c2** 3
print(res)
Problem p03296 (python)

Fixed submission:
N  = int(input())
za = list( map(int, input().split()) )
res = 0
for i in range(1,N):
 if za[i]==za[i-1]:
  za[i] = -1
  res+=1

print(res)

Buggy submission (verdict: Runtime Error):
T  = int(input())
def gcd(a,b):
    if b==0: return a
    return gcd(b, a%b)
for _ in range(T):
    a,b,c,d =list( map(int, input().split()) )
    if a<b or d<b:
        print('No')
        continue
    a %= b
    d%=b
    d = gcd(d,b)
    if c>= b:
        print('Yes')
        continue
    x = (b-a)//d
    y = a+ x*d
    if y == b: y-=d
    if y>c:
        print('No')
    else:
        print('Yes')

Buggy submission (verdict: Runtime Error):
T  = int(input())
def gcd(a,b):
 if b==0: return a
 return gcd(b, a%b)
for _ in range(T):
 a,b,c,d =list( map(int, input().split()) )
 a %= b
 d%=b
 d = gcd(d,b)
 if c>= b:
  print('Yes')
  continue
 x = (b-a)//d
 y = a+ x*d
 if y == b: y-=d
 if y>=c:
  print('No')
 else:
  print('Yes')
Problem p03087 (python)

Fixed submission:
N, Q = map(int, input().split())
S = input()
l = [None] * Q
r = [None] * Q
for i in range(Q):
    l[i], r[i] = map(int, input().split())
    l[i] -= 1
    r[i] -= 1

sumbgn = [0] * N
sumend = [0] * N
for i in range(1, N):
    if S[i-1:i+1] == 'AC':
        sumbgn[i-1] = sumbgn[i-2] + 1 if i-2 >= 0 else 1
        sumend[i] = sumend[i-1] + 1
    else:
        sumbgn[i-1] = sumbgn[i-2] if i-2 >= 0 else 0
        sumend[i] = sumend[i-1]

for i in range(Q):
    sumr = sumend[r[i]]
    suml = sumbgn[l[i]-1] if l[i] > 0 else 0
    print(sumr - suml)

Buggy submission (verdict: Runtime Error):
BASE = ['A', 'T', 'C', 'G']

N, Q = map(int, input().split())
S = input()
l = [None] * N
r = [None] * N
for i in range(Q):
    l[i], r[i] = map(int, input().split())
    l[i] -= 1
    r[i] -= 1

cumsum = [0] * N
sumbgn = [0] * N
sumend = [0] * N
tmpsum = 0
for i in range(1, N):
    if S[i-1:i+1] == 'AC':
        sumbgn[i-1] = sumbgn[i-2] + 1 if i-2 >= 0 else 1
        sumend[i] = sumend[i-1] + 1
    else:
        sumbgn[i-1] = sumbgn[i-2] if i-2 >= 0 else 0
        sumend[i] = sumend[i-1]

for i in range(Q):
    sumr = sumend[r[i]]
    suml = sumbgn[l[i]-1] if l[i] > 0 else 0
    print(sumr - suml)
Problem p03030 (python)

Fixed submission:
N = int(input())
city_score = [[i for i in input().split()] for i in range(N)]
city = list()
score = list()
all = list()
for i in range(N):
    city.append(city_score[i][0])
    score.append(city_score[i][1])
    all.append([city_score[i][0], int(city_score[i][1]), i+1])
    
while(True):
    min_word = "zzzzzzzzzz"
    max_score = -1
    ans = 0
    index = 0
    for i in range(len(all)):
        if((all[i][0] < min_word) or (all[i][0] == min_word and all[i][1] > max_score)):
                max_score = all[i][1]
                min_word = all[i][0]
                ans = all[i][2]
                index = i
    print(ans)
    all.pop(index)
    #print(all)
    if(len(all) == 0):
        break

Buggy submission (verdict: Runtime Error):
import pandas as pd
N = int(input())
city_score = [[i for i in input().split()] for i in range(N)]
all = list()
for i in range(N):
    all.append([city_score[i][0], int(city_score[i][1])*-1, i+1])
df = pd.DataFrame(all, columns=['city', 'score', 'index'])
df = df.sort_values(["city","score"])
result = list(df["index"].values)
for i in result:
    print(i)
Problem p03031 (python)

Fixed submission:
import numpy as np
import itertools
N, M = list(map(int, input().split()))
tmp = [[int(i) for i in input().split()] for i in range(M)]
p = list(map(int, input().split()))
ans = 0
for switch in itertools.product(range(2),repeat=N):
    #print(switch)
    num_clear_light = 0
    for i in range(M):
        count = 0
        for j in range(tmp[i][0]):
            #print(tmp[i][j+1])
            if(switch[tmp[i][j+1] - 1] == 1):
                count += 1
        if(count % 2 == p[i]):
            num_clear_light += 1
    if(num_clear_light == M):
        ans += 1
    num_clear_light = 0

print(ans)

Buggy submission (verdict: Runtime Error):
import numpy as np
import itertools
#N, M = list(map(int, input().split()))
N = 2
M = 2
tmp = [[int(i) for i in input().split()] for i in range(M)]
p = list(map(int, input().split()))
ans = 0
for switch in itertools.product(range(2),repeat=N):
    #print(switch)
    num_clear_light = 0
    for i in range(M):
        count = 0
        for j in range(tmp[i][0]):
            #print(tmp[i][j+1])
            if(switch[tmp[i][j+1] - 1] == 1):
                count += 1
        if(count % 2 == p[i]):
            num_clear_light += 1
    if(num_clear_light == M):
        ans += 1
    num_clear_light = 0

print(ans)
Problem p03047 (python)

Fixed submission:
a,b= input().split()
N = int(a)
K = int(b)
print(N-K+1)

Buggy submission (verdict: Runtime Error):
a,b,c,d= input().split()
N = int(d)
R= int(a)
G = int(b)
B = int(c)

max_r = N//R
max_g = N//G
max_b = N//B
count = 0
for i in range(max_r+1):
 rest_n_r= N - R*i
 max_g = rest_n_r // G
 for j in range(max_g+1):
  rest_n_r_g = rest_n_r - G*j
  mod = rest_n_r_g % B
  if(mod == 0):
   count += 1

print(count)
Problem p03160 (python)

Fixed submission:
import numpy as np
N = int(input())
H = [int(x) for x in input().split()]

cost = np.full(N, float('inf'))
cost[0] = int(0)
cost[1] = abs(H[0]-H[1])
for i in range(2, N):
    cost[i] = min(abs(H[i]-H[i-1]) + cost[i-1], abs(H[i]-H[i-2]) + cost[i-2])

print(int(cost[N-1]))

Buggy submission (verdict: Runtime Error):
import numpy as np
import math
N = int(input())
H = [int(x) for x in input().split()]

cost = np.full(N, math.inf)
cost[0] = int(0)
cost[1] = abs(H[0]-H[1])
for i in range(2, N):
    cost[i] = min(abs(H[i]-H[i-1]) + cost[i-1], abs(H[i]-H[i-2]) + cost[i-2])

print(int(cost[N-1]))
Problem p03416 (python)

Fixed submission:
a, b = map(int, input().split())
count = 0
for i in range(a, b+1):
    s = str(i)
    if(len(s) == 1):
        count += 1
        break
    for j in range(len(s) // 2):
        if(s[j] != s[len(s)-1-j]):
            break
    else:
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
count = 0
for i in range(a, b):
    s = str(i)
   if(len(s) == 1):
      break
    for j in range(len(s) // 2):
        if(s[j] != s[len(s)-1-j]):
            break
    else:
        count += 1
print(count)
Problem p03129 (python)

Fixed submission:
import numpy as np
n, k = (int(x) for x in input().split())
if n%2==0:
  if k <= n/2:
    print("YES")
  else:
    print("NO")
if n%2!=0:
  if k <= np.ceil(n/2):
    print("YES")
  else:
    print("NO")

Buggy submission (verdict: Runtime Error):
import numpy as np
n, k = (int(x) for x in input().split())
if n%2==0:
  if k <= n/2
    print("YES")
  else:
    print("NO")
if n%2!=0:
  if k <= np.ceil(n/2)
    print("YES")
  else:
    print("NO")

Buggy submission (verdict: Runtime Error):
import numpy as np
n, k = (int(x) for x in input().split())
if n%2==0:
  if k <= n/2.0
  print("YES")
else:
  print("NO")
if n%2!=0:
  if k <= np.ceil(n/2.0)
  print("YES")
else:
  print("NO")
Problem p03024 (python)

Fixed submission:
s=input();print("YNEOS"[15-len(s)+s.count("o")<8::2])

Buggy submission (verdict: Runtime Error):
s=input();print("YNEOS"[15-len(s)+s.count("o")<8::2])'
Problem p03050 (python)

Fixed submission:
n=int(input())
d=[]
c=[]
for i in range(1,int(n**.5)+1):
  if n%i==0:
    for p in [i-1,n//i-1]:
      if p==0:continue
      if n%p==n//p:
        c.append(p)
print(sum(c))

Buggy submission (verdict: Runtime Error):
n=int(input())
c=[]
for i in range(1,int(n**.5)+1):
  if n%i==0:
    p=n//i-1
    if n%p==n//p:
      c.append(p)
print(sum(c))
Problem p03211 (python)

Fixed submission:
s=input()
l=len(s)
T=753
c=[None]*(l-2)
for sp in range(l-2):
	c[sp]=abs(int(s[sp:(sp+3)])-T)
print(min(c))

Buggy submission (verdict: Runtime Error):
s=input()
l=len(s)
T=753
c=[None]*(l-2)
for s in range(l-2):
	c[s]=abs(int(s[s:(s+3)])-T)
print(min(c))

Buggy submission (verdict: Runtime Error):
=> 0, 1, 2
s=input()
l=len(s)
T=753
c=[None]*(l-2)
for s in range(l-2):
	c[s]=abs(int(s[s:(s+3)])-T)
print(min(c))
Problem p03238 (python)

Fixed submission:
n=int(input())
if n==1:
  print('Hello World')
else:
  a=int(input())
  b=int(input())
  print(a+b)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
b=int(input())
print('Hello World' if n==1 else a+b)
Problem p03289 (python)

Fixed submission:
a=input();b=a[1:].replace('C','');print('WAAC'[a[0]=="A"and 1==a[2:-1].count("C")and b.lower()==b::2])

Buggy submission (verdict: Runtime Error):
a=input();b=a[1:].replace('C','');print('WAAC'[a[0]=="A"and1==a[2:-1].count("C")and b.lower()==b::2])
Problem p03328 (python)

Fixed submission:
a,b=map(int,input().split())
def cumsum(n):
  return sum([i for i in range(n+1)])
print(cumsum(b-a)-b)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
def cumsum(n):
  if n==1:
    return 1
  elif n>1:
    return cumsum(n-1)+n
print(cumsum(b-a)-b)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
def cumsum(n):
  if n==1:
    return 1
  else:
    return cumsum(n-1)+n
print(cumsum(b-a)-b)
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,b=map(int,input().split())

print(a if a<=b else: a-1)
Problem p03386 (python)

Fixed submission:
a,b,k=map(int,input().split())
if b-a+1<2*k:
  l=range(a,b+1)
else:
  l=list(range(a,a+k))+list(range(b-k+1,b+1))
for i in l:
  print(i)

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
l=list(range(a,b+1))
for i in sorted(set(l[:k]+l[-k:])):
  print(i)
Problem p03407 (python)

Fixed submission:
a,b,c=map(int,input().split())
print('Yes' if a+b>=c else 'No')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input())
print('Yes' if a+b>=c else 'No')
Problem p03470 (python)

Fixed submission:
n=int(input())

radii=[int(input()) for _ in range(n)]
print(len(list(set(radii))))

Buggy submission (verdict: Runtime Error):
n=int(input())
arr=[int(input()) for idx in range(n)]

print(length(list(set(arr))))

Buggy submission (verdict: Runtime Error):
n=int(input())
arr=[int(input()) for idx in range(n)]

print(length(set(arr)))
Problem p03477 (python)

Fixed submission:
o=input().split();s=sum(map(int,o));sl=sum(map(int,o[:2]))
if sl>s/2:
  m='Left'
elif sl==s/2:
  m='Balanced'
else:
  m='Right'
print(m)

Buggy submission (verdict: Runtime Error):
s=sum(map(int,input().split()));
sl=sum(map(int,input().split()[:2]))
if sl>s/2:
  m='Left'
elif sl==s/2:
  m='Balanced'
else:
  m='Right'
print(m)
Problem p03485 (python)

Fixed submission:
s=sum(map(int,input().split()));print(s//2+int(bin(s)[-1]))

Buggy submission (verdict: Runtime Error):
a,_,b=input();s=int(a)+int(b);print(s//2+int(bin(s)[-1]))
Problem p03502 (python)

Fixed submission:
n=int(input())
def ds(n):
  return sum(map(int,str(n)))
print('Yes' if n%ds(n)==0 else 'No')

Buggy submission (verdict: Runtime Error):
def ds(n):
  return sum(map(int,str(n)))
print(n%ds(n)==0)
Problem p03543 (python)

Fixed submission:

s=int(input())
print("Yes" if any([str(i)*3 in str(s) for i in range(10)]) else "No" )

Buggy submission (verdict: Runtime Error):
s=int(input())
print("YES" any([str(i)*3 in str(s) for i in range(10)]) else "NO")
Problem p03796 (python)

Fixed submission:
import math;print(math.factorial(int(input()))%int(7+1e9))

Buggy submission (verdict: Runtime Error):
import math;print(math.factorial(int(input()))%(7+1e9))
Problem p03006 (python)

Fixed submission:
n = int(input())
a = [tuple(map(int, input().split())) for i in range(n)]
t = set(a)
assert len(t) == len(a)
minans = 1000000000000
for i in range(n):
    for j in range(i + 1, n):
        r = t.copy()
        p = a[i][0] - a[j][0]
        q = a[i][1] - a[j][1]
        curans = 0
        while r:
            curans += 1
            m = r.pop()
            z = m
            while (m[0] + p, m[1] + q) in r:
                m = (m[0] + p, m[1] + q)
                r.remove(m)
            m = z
            while (m[0] - p, m[1] - q) in r:
                m = (m[0] - p, m[1] - q)
                r.remove(m)
        minans = min(minans, curans)
if minans == 1000000000000:
    print(1)
else:
    print(minans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = [tuple(map(int, input().split())) for i in range(n)]
t = set(a)
minans = 1000000000000
for i in range(n):
    for j in range(i + 1, n):
        r = t.copy()
        p = a[i][0] - a[j][0]
        q = a[i][1] - a[j][1]
        curans = 0
        while r:
            curans += 1
            m = r.pop()
            z = m.copy()
            while (m[0] + p, m[1] + q) in r:
                m = (m[0] + p, m[1] + q)
                r.remove(m)
            m = z.copy()
            while (m[0] - p, m[1] - q) in r:
                m = (m[0] - p, m[1] - q)
                r.remove(m)
        minans = min(minans, curans)
print(minans)
Problem p03448 (python)

Fixed submission:
a = [int(input()) for i in range(4)]
count = 0

for i in range(a[0]+1) :
  for j in range(a[1]+1) :
    for k in range(a[2]+1) :
      sum = 500*i + 100*j + 50*k
      if sum == a[3] :
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = [int(input()) for i in range(4)]
count = 0

for (i = 0; i <= a[0]; i++) :
  for (j = 0; j <= a[1]; j++) :
    for (k = 0; k <= a[2]; k++) :
      sum = 500*i + 100*j + 50*k
      if sum == a[3] :
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = [int(input()) for i in range(4)]
count = 0
y = a[3]
i = y / 500; if i > a[0] : i = a[0]; y -= i * 500
j = y / 100; if j > a[1] : j = a[1]; y -= j * 100
k = y /  50; if k > a[2] : k = a[2]; y -= k * 50
if (y == 0) :
  count += 1
  if i > 0 :
    while (i > 0 and j + 5 <= a[1]) :
      i -= 1
      j += 5
      tmp1 = j
      tmp2 = k
      count += 1
      while (tmp1 > 0 and tmp2 + 2 <= a[2]) :
        tmp1 -= 1
        tmp2 += 2
        count += 1
      tmp1 = j
      tmp2 = k
  elif i == 0 and j > 0:
    while (j > 0 and k + 2 <= a[2]) :
        j -= 1
        k += 2
        count += 1

print(count)

Buggy submission (verdict: Runtime Error):
a = [int(input()) for i in range(4)]
count = 0
y = a[3]
i = y / 500; if i > a[0] : i = a[0]; y -= i * 500
j = y / 100; if j > a[1] : j = a[1]; y -= j * 100
k = y /  50; if k > a[2] : k = a[2]; y -= k * 50
if (y == 0) :
  count += 1
  while (i > 0 && j + 5 < a[1]) :
    i -= 1
    j += 5
    tmp1 = j
    tmp2 = k
    count += 1
    while (tmp1 > 0 && tmp2 + 2 < a[2]) :
      tmp1 -= 1
      tmp2 += 2
      count += 1
    tmp1 = j
    tmp2 = k

print(count)

Buggy submission (verdict: Runtime Error):
a = [int(input()) for i in range(4)]
count = 0
for i in range(a[0], -1, -1) :
  y = a[3]
  if (y > 500*i):
    y -= i*500
    if y == 0:
      count += 1
      continue
    for j in range(a[1], -1, -1) :
      if (y > j*100) :
        y -= j*100
        if y == 0:
          count += 1
          continue
      for k in range(a[2], -1, -1) :
        if (y > k*50) :
          y -= k*50
          if y == 0:
      count += 1
      continue
print(count)
Problem p03455 (python)

Fixed submission:
a = list(map(int,input().split()))
if (a[0]%2==0) or (a[1]%2==0) :
  print("Even")
else:
  print("Odd")

Buggy submission (verdict: Runtime Error):
a = list(map(int,input().split()))
if a[0]%2==0 || a[1]%2==0 :
  print("Even")
else:
  print("Odd")

Buggy submission (verdict: Runtime Error):
a = list(map(int, input().split()))
if a[0]%2==0 || a[1]%2==0 :
  print("Even")
else:
  print("Odd")
Problem p03494 (python)

Fixed submission:
a = int(input())
b = list(map(int, input().split()))
count = 0
while(1):
  flag = 0
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      flag = 1
  if (flag == 1) :
    break
  for i in range(0, a, 1):
    b[i] /= 2
  count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = list(map(int, input().split()))
count = 0
while(true):
  flag = 0
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      flag = 1
  if flag == 1:
    break
  for i in range(0, a, 1):
    b[i] /= 2
  count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = list(map(int, input().split()))
count = 0
while(true):
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      break;
  for i in range(0, a, 1):
    b[i] /= 2
  count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = int(input()) // 値の数
b = list(map(int, input().split()))
count = 0
while(1):
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      break;
  for i in range(0, a, 1):
    b[i] /= 2
  count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = int(input()) // 値の数
b = list(map(int, input().split()))
count = 0
while(1):
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      break;
  for i in range(0, a, 1):
    b[i] /= 2
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = int(input()) // 値の数
b = list(map(int, input().split()))
min = 100000
for i in range(a):
  try = 0
  while(b[i]%2 == 0):
    b[i] = b[i] / 2
    try += 1
  if try < min:
    min = try
print(min)

Buggy submission (verdict: Runtime Error):
a = int(input()) // 値の数
b = list(map(int, input().split()))
min = 100000
for i in range(a):
  try = 0
  while(b[i]%2 != 0):
    b[i] = b[i] / 2
    try += 1
  if try < min:
    min = try
print(min)

Buggy submission (verdict: Runtime Error):
a = int(input()) // 数の個数
b = list(map(int, input().split())) // それぞれの値
min = 100000
for i in range(a):
  n = 0
  try = 0
  while(2**n <= b[i]):
    try += (b[i] / 2**n)
  if try < min :
    min = try
print(min)

Buggy submission (verdict: Runtime Error):
a = int(input()) // 数の個数
b = list(map(int, input().split())) // それぞれの値
min = 100000
for i in range(a):
  if (min > (b[i]/2)):
    min = b[i]/2
print(min)

Buggy submission (verdict: Runtime Error):
a = input() // 数の個数
b = list(map(int, input().split())) // それぞれの値
count = 0
while(1):
  for i in range(a):
    if b[i] % 2 == 1:
      break;
    else :
      b[i] /= 2
  count += 1
print(count)

Buggy submission (verdict: Runtime Error):
a = input() // 数の個数
b = list(map(int, input().split())) // それぞれの値
count = 0
while(1):
  for i in range(a):
    if b[i] % 2 == 1:
      print("0")
      return 0;
  b /= 2
  count += 1
print(count)
Problem p03547 (python)

Fixed submission:
X, Y = input().split()
if int(X, 16) > int(Y, 16):
    print('>')
elif int(X, 16) < int(Y, 16):
    print('<')
else:
    print('=')

Buggy submission (verdict: Runtime Error):
X,Y = input().split()
if int(X, 16) = int(Y, 16):
    print('=')
elif int(X, 16) > int(Y, 16):
    print('>')
else:
    print('<')