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

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

Buggy submission (verdict: Runtime Error):
K = int(input())
ans = [1,2,3,4,5,6,7,8]
num = 9
while(len(ans)<K):
    if str(num)[-1]=="9":
        if str(num)[1:].count("9")==len(str(num)[1:]):
            ans.append(num)
    num += 1

for i in range(K):
    print(ans[i])
Problem p02754 (python)

Fixed submission:
a = input().split()

N = int(a[0])
A = int(a[1])
B = int(a[2])

i = int(N/(A+B))

cut = N - (A+B)*i

if N < A:
  Blue_Ball_Num = N
elif N < A+B:
  Blue_Ball_Num = A
elif cut > A:
  Blue_Ball_Num = A*(i+1)
else:
  Blue_Ball_Num = A*i + (N - (A+B)*i)
  
print(Blue_Ball_Num)

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

N = int(a[0])
A = int(a[1])
B = int(a[2])

i = int(N/(A+B))

cut = N - (A+B)*i
if n < A:
  Blue_Ball_Num = N
elif N < A+B:
  Blue_Ball_Num = A
elif cut > A:
  Blue_Ball_Num = A*i
else:
  Blue_Ball_Num = A*i + (N - (A+B)*i)
  
print(Blue_Ball_Num)

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

N = int(N)
A = int(A)
B = int(B)

count = 0
i = 0

while 1:
  count = count + A + B
  i += 1
  if count > N:
    break

cut = N - (A+B)*(i-1)
print(cut)

if cut > A:
  Blue_Ball_Num = A*i
else:
  Blue_Ball_Num = A*i + ((A+B)*i - N)
  
print(Blue_Ball_Num)
Problem p02879 (python)

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

Buggy submission (verdict: Runtime Error):
a,b= map.(int, input().split())
ans=a*b
if ans=>81:
  print('Yes')
else:
  print('No')
Problem p02933 (python)

Fixed submission:
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Buggy submission (verdict: Runtime Error):
=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Buggy submission (verdict: Runtime Error):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  input('red')

Buggy submission (verdict: Runtime Error):
=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Buggy submission (verdict: Runtime Error):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  input('red')

Buggy submission (verdict: Runtime Error):
a=int(input())
s=input()
if a>=3200:
  print(a)
else:
  input('red')
Problem p02951 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c=map(int, input().split())
if a-b>=c:
  print(0)
else:
  print(c-a+b
Problem p02831 (python)

Fixed submission:
import fractions

A,B = map(int, input().split())
print(A * B // fractions.gcd(A, B))

Buggy submission (verdict: Runtime Error):
import math

A,B = map(int, input().split())
print(A * B // math.gcd(A, B))

Buggy submission (verdict: Runtime Error):
import math

A,B = map(int, input().split())
print(A * B // math.gcd(A, B))
Problem p03072 (python)

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

ans = 0

for i in range(N):
    count = 0
    for j in range(i):
        if(H[i] >= H[j]):
            count += 1
    if(count == i):
        ans += 1

print(ans)

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

ans = 1
if(N >= 2):
    if(H[1] > H[0]):
        ans += 1

if(N >= 3):
    for i in range(1,N):
        if(H[i] >= max(H[:i-1])):
            ans += 1

print(ans)
Problem p03272 (python)

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

print(N-(i-1))

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

print(N-(i-1)

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

print(N-(i-1)
Problem p03207 (python)

Fixed submission:
n = int(input())

max_index = 0
max_price = 0
price_list = []

for i in range(0, n):
    p = int(input())
    price_list.append(p)
    if max_price < p:
        max_price = p
        max_index = i

p_sum = 0
for i, p in enumerate(price_list):
    if i == max_index:
        p_sum += p / 2
    else:
        p_sum += p

print(int(p_sum))

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

max_index = 0
max_price = 0
price_list = []

for i in range(0, n + 1):
    p = int(input())
    price_list.append(p)
    if max_price < p:
        max_index = i

sum = 0
for i, p in enumerate(price_list):
    if i == max_index:
        sum += p / 2
    else:
        sum += p

print(sum)
Problem p02753 (python)

Fixed submission:
s = input()
if s[0] == s[1] and s[1] == s[2] and s[2] == s[0]:
  print("No")
  exit()
  
print("Yes")

Buggy submission (verdict: Runtime Error):
s = input()
if s[0] == s[1] and s[1] = s[2] and s[2] == s[0]:
  print("No")
  exit()
  
print("Yes")
Problem p02771 (python)

Fixed submission:
a, b, c = input().split()
 
if len(set([a, b, c])) == 2:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a, b, c = input()

if len(set([a, b, c])) == 2:
  print("yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a, b, c = input()

if len(set(a, b, c)) == 2:
  print("yes")
else:
  print("No")
Problem p02779 (python)

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

if len(list_n) == len(set(list_n)):
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
n = int(input())
list_n = []
for i in range(n):
    list_n.append(int(input()))

if len(list_n) == len(set(list_n)):
    print("YES")
else:
    print("NO")
Problem p02881 (python)

Fixed submission:
from operator import itemgetter
n = int(input())

list_p = []
for i in range(1, int(n**0.5)+1):

    j = n / i

    if j.is_integer():
        list_p.append([i, j, i+j])

list_sorted = sorted(list_p, key=itemgetter(2))
print(int(list_sorted[0][0] + list_sorted[0][1] - 2))

Buggy submission (verdict: Runtime Error):
from operator import itemgetter
n = int(input())

list_p = []
for i in range(n):
    for j in range(n - i):
        if i*j == 100:
            list_p.append([i, j, i+j])
list_sorted = sorted(list_p, key=itemgetter(2))
print(list_sorted[0][0] + list_sorted[0][1] - 2)
Problem p02912 (python)

Fixed submission:
import heapq as hp
n, m = map(int, input().split())
list_A = list(map(int, input().split()))
# list_A = sorted(list_A)

a_q = []
for i in list_A:
    hp.heappush(a_q, -1*i)

for i in range(m):
    tmp = hp.heappop(a_q)
    tmp = hp.heappush(a_q, int(tmp/2))

print(-sum(a_q))

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

for i in range(m):
    if list_A[-2] > list_A[-1]:
        list_A = sorted(list_A)
    list_A[-1] = int(list_A[-1]/2)

            # print(i, j, list_A[j])

print(sum(list_A))
Problem p02753 (python)

Fixed submission:
s = input()
if "AB" in s or "BA" in s:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
for i in range(1,1009):
    if int(i*0.08) == a and int(i*0.1) == b:
        print(int(i))
print("-1")

Buggy submission (verdict: Runtime Error):
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s + "".join(list1))

Buggy submission (verdict: Runtime Error):
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s + "".join(list1))
Problem p02987 (python)

Fixed submission:
s = input()
if len(set(s)) == 2 and s.count(s[0]) == 2:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n = int(input())
p_list = list(map(int, input().split()))
count = 0
for i in range(1,len(p_list)-1):
    if p_list[i-1] < p_list[i] < p_list[i+1]:
        count += 1
    if p_list[i-1] > p_list[i] > p_list[i+1]:
        count += 1
print(count)
Problem p03041 (python)

Fixed submission:
n, k = map(int, input().split())
s = list(input()) #文字列はそのままだとイミュータブル
s[k-1] = chr(ord(s[k-1]) + 32)
print("".join(s))

Buggy submission (verdict: Runtime Error):
s = list(input())
head = int(s[0] + s[1])
tail = int(s[2] + s[3])

if (0 < head < 13) and (0 < tail < 13):
    print('AMBIGUOUS')
elif 0 < tail < 13:
    print('YYMM')
elif 0 < head < 13:
    print('MMYY')
else:
    print('NA')

Buggy submission (verdict: Runtime Error):
s = list(input())
head = int(s[0] + s[1])
tail = int(s[2] + s[3])
if (head == 0 or 12 < head < 100) and (0 < tail < 13): #YYは00も含む
    print('YYMM')
elif (0 < head < 13) and (tail == 0 or 12 < tail < 100):
    print('MMYY')
elif (0 < head < 13) and (0 < tail < 13):
    print('AMBIGUOUS')
else:
    print('NA')
Problem p02753 (python)

Fixed submission:
a = input()
if ("B" in a) & ("A" in a):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a,b = map(int, input().split(" "))
list_a = [i for i in range(round(a/0.08+0.5)-1, round((a+1)/0.08 +0.5))]
list_b = [i for i in range(round(b/0.1 +0.5)-1,round((b+1)/0.1 +0.5))]
list_and = list(set(list_a) & set(list_b))
if list_and == []:
    print("-1")
else:
    print(min(list_and))
Problem p02753 (python)

Fixed submission:
S = input()
if S[0] == S[1] and S[1] == S[2]:
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
S = input
if S[0] == S[1] and S[1] == S[2]:
  print('No')
else:
  print('Yes')
Problem p02879 (python)

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

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if a<10 and b<10:
  print(a*b)
else:
  print("-1")

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if a<10 and b<10:
  print(a*b)
else:
  print(-1)
Problem p02915 (python)

Fixed submission:
print(int(input())**3)

Buggy submission (verdict: Runtime Error):
N = input()
P = N**3
print(P)

Buggy submission (verdict: Runtime Error):
print(input()**3)
Problem p02916 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))

Buggy submission (verdict: Runtime Error):
N = int(input())
A = [map(int,input().split())]
B = [map(int,input().split())]
C = [map(int,input().split())]
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))

Buggy submission (verdict: Runtime Error):
N = int(input())
A = [map(int,input().split())]
B = [map(int,input().split())]
C = [map(int,input().split())]
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[i])
print(sum(B))

Buggy submission (verdict: Runtime Error):
B = 0
N = int(input())
A = (int(input()) for i in range(N))
for i in range(N):
  B += int(input())
C = (int(input()) for i in range(N-1))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B += C[i]
print(B)

Buggy submission (verdict: Runtime Error):
B = 0
N = int(input())
A = (int(input()) for i in range(N))
for i in range(N):
  B += input()
C = (int(input()) for i in range(N-1))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B += C[i]
print(B)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = []
B = 0
C = []
for i in range(N):
  A[i] = int(input())
for i in range(N):
  B += int(input())
for i in range(N-1):
  C[i] = int(input())
for i in range(N-1):
  if A[i] +1 == A[i+1]:
    B += C[i]
print(B)
Problem p02951 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(b+c-a,0)[b+c-a<=0:]
Problem p02753 (python)

Fixed submission:
s=input()
if s=='AAA' or s=='BBB':
    print('No')
else:
    print('Yes')

Buggy submission (verdict: Runtime Error):
s = input()
if s == 'AAA' or s == 'BBB':
  print('No')
  
  else:
    print('Yes')

Buggy submission (verdict: Runtime Error):
 s = input()
if(s[0]==s[1] and s[1]==s[2]):
    print("No")
else:
    print("Yes")
Problem p03041 (python)

Fixed submission:
n,k = map(int,input().split())
s = input()
ret=""
for i in range(n):
  if i != k-1:
    ret +=s[i]
  else:
    ret+=s[i].lower()

print(ret)

Buggy submission (verdict: Runtime Error):
n,k = map(int,input().split())
s = input()
s[k-1] = s[k-1].lower()
print(s)
Problem p03209 (python)

Fixed submission:
n,x = map(int,input().split())
 
#レベルnバーガーの構造は、1,2^(n+1)-3,1,2^(n+1)-3,1
 
ans = 0
x2 = x
k=n
while True:
  thk = [1,2**(k+1)-3,1,2**(k+1)-3,1]
  pc = [0,2**k-1,1,2**k-1,0]
  for i in range(5):
    x2-=thk[i]
    if x2<0:
      x2+=thk[i]
      k-=1
      break
    elif x2==0:
      ans+=pc[i]
      print(ans)
      exit()
    else:
      ans+=pc[i]

Buggy submission (verdict: Runtime Error):
using System;
using System;
using System.Collections.Generic;
using System.Linq;


    class Solver5
    {
        /*
         * 
         * https://atcoder.jp/contests/abc115/tasks/abc115_d
         * 
         */
 public void Solve5()
        {
            var nx = u.readLongArrayBySplit();
			var n = nx[0];
            var x = nx[1];
            long ans = 0;

            while (true)
            {
                var thk = new long[5]{ 1, (long)Math.Pow(2,n + 1) - 3, 1, (long)Math.Pow(2, n + 1) - 3, 1 };
                var pc = new long[5] { 0, (long)Math.Pow(2, n ) - 1 , 1, (long)Math.Pow(2, n )- 1, 0 };
                for (int i = 0; i < 5; i++)
                {
                    if (x > thk[i])
                    {
                        x -= thk[i];
                        ans += pc[i];
                    }
                    else if (x < thk[i])
                    {
                        n--;
                        break;
                    }
                    else
                    {
                        ans += pc[i];
                        Console.WriteLine(ans.ToString());
                        return;
                    }
                }

            }

        }
        static void Main()
        {
            var solver = new Solver5();
            solver.Solve5();
        }
    }
    static class u
    {
      public static long[] readLongArrayBySplit() { return Console.ReadLine().Split(' ').Select(s => long.Parse(s)).ToArray(); }
    }
Problem p02753 (python)

Fixed submission:
S = input()
if S[0] == S[1] == S[2]:
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i++
  if math.float(i)==a and math.float(i)==b:
    print(i)
    break
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
 
for i in range(10000):
  if i//100*8==a and i//100*10==b:
    print(i)
  else:
    print(-1)
Problem p02754 (python)

Fixed submission:
S,a,b=(int(x) for x in input().split())
ans = S//(a+b) * a
rem = S % (a+b )
ans +=min(rem,a)
print(ans)

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

if a==b+c:
  print(b)
elif b==0:
  print(0)
else:
  print(a-c+b)
Problem p02777 (python)

Fixed submission:
a,b=input().split()
a_num,b_num=input().split()
c=input()
 
if c==a:
  a_num=int(a_num)-1
elif c==b:
  b_num=int(b_num)-1
print(a_num,b_num)

Buggy submission (verdict: Runtime Error):
s=input()
array=[]
array+=(int(x) for x in input().split())
array.sort()
def judge(array,s):
  for i in range(int(s)-1):
    if array[i] == array[i+1]:
        return "NO"
  return "YES"

print(judge(array,s))

Buggy submission (verdict: Runtime Error):
s=input()
array=[]
array+=(int(x) for x in input().split())
array.sort()
def judge(array,s):
  for i in range(int(s)-1):
    if array[i] == array[i+1]:
        return "NO"
  return "YES"

print(judge(array,s))

Buggy submission (verdict: Runtime Error):
s=input()
array=[]
array+=(int(x) for x in input().split())

def judge(array,s):
  for i in range(int(s)-1):
    if array[i] == array[i+1]:
        return True
  else:
    return False

print(judge(array,s))

Buggy submission (verdict: Runtime Error):
s=input()
array=[]
array+=(int(x) for x in input().split())

def judge(array,s):
  for i in range(int(s)-1):
    if array[i] == array[i+1]:
        return True
  else:
    return False

print(judge(array,s))

Buggy submission (verdict: Runtime Error):
s=input()
array=[]
array+=(int(x) for x in input().split())

def judge(array,s):
  for i in range(int(s)-1):
    print(array[i],array[i+1])
    if array[i] == array[i+1]:
        return True
  else:
    return False

print(judge(array,s))

Buggy submission (verdict: Runtime Error):
name_a,name_b=(x for x in input().split())
a_count,b_count=(int(x) for x in input().split())
fetch_color=input()
 
if fetch_color==name_a:
  a_coount = a_count-1
elif:
  fetch_color==name_b
  b_count = b_count-1
print(a_count,b_count)

Buggy submission (verdict: Runtime Error):
name_a,name_b=(x for x in input().split())
a_count,b_count=(int(x) for x in input().split())
fetch_color=input()

if fetch_color=name_a:
  a_coount = a_count-1
elif:
  fetch_color=name_b
  b_count = b_count-1
print(a_count,b_count)

Buggy submission (verdict: Runtime Error):
a,b=input().split()
a_num,b_num=intinput().split()
c=input()

if c==a:
  a_num=int(a_num)-1
  return a_num,b_num
elif c==b:
  b_num=int(b_num)-1
  return a_num,b_num
Problem p02779 (python)

Fixed submission:
length=input()
#len-1
Narray=sorted(input().split())
n=0
while n<int(length)-1:
	if Narray[n] == Narray[n+1]:
		print("NO")
		break
	elif n==int(length)-2:
		print("YES")
		break
	else:
		n+=1

Buggy submission (verdict: Runtime Error):
len=input()
#len-1
Narray=sorted(input().split())
n=0
while True
	if not Narray[n] == Narray[n+1]:
    	pass
    elif:
      print("NO")
print("yes")
Problem p02753 (python)

Fixed submission:
S=input()
if S[0]==S[1] and S[1]==S[2]:
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
S=input()
if S[1]==S[2] and S[2]==S[3]:
  print('No')
else:
  print('Yes')
Problem p02897 (python)

Fixed submission:
a = int(input())

if a%2 == 0 :
  print("0.5000000000") 
else  :
  temp = a//2 +1 
  temp = temp/a 
  print(temp)

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

if a%2 ==0 :
  print("0.5000000000") 
else  :
  temp = n//2 +1 
  temp = temp/n 
  print(temp)
Problem p02753 (python)

Fixed submission:
S = raw_input()
if S[0] == S[1] and S[1] == S[2]:
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
S = input()
if S == "AAA" or B == "BBB":
  print("No")
else:
  print("Yes")
Problem p02754 (python)

Fixed submission:
n , a, b = map(int, input().split())
ans = n//(a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)

Buggy submission (verdict: Runtime Error):
n, a b = map(int, input().split())
ans = n// (a + b)
rem = n % (a + b)
ans += min(rem, A)
prnit(ans)
Problem p02754 (python)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)

Buggy submission (verdict: Runtime Error):
S = input()
N = int(S[0])
A = int(S[2])
B = int(S[4])
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

Buggy submission (verdict: Runtime Error):
S = input()
N = int(S[0])
A = int(S[1])
B = int(S[2])
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

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

b_count = 0
for i in len(N):
  if i % (A+B) < A:
    b_count = b_count + 1
print(b_count)
Problem p02759 (python)

Fixed submission:
N = input()
if N.isdigit() and int(N) >= 1 and  int(N) <= 100:
  if int(N) % 2 == 0:
    ans = int(N) / 2
  else:
    ans = (int(N) - 1) / 2 + 1
  print(int(ans))
else:
  print('error')

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

if N.isdigit() and N >= 1 and  N <= 100:
  if N % 2 == 0:
    ans = N / 2
  else:
    ans = (N - 1) / 2 + 1
  print(ans)
else:
  print('error')
Problem p02759 (python)

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

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

if N % 2 = 0:
    print(N // 2)
else:
    print(N // 2 + 1)

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

if N % 2 = 0:
    print(N / 2)
else:
    print(N // 2 + 1)

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

if N % 2 = 0:
    print 'N'
else:
    print 'N + 1'

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

if N % 2 = 0:
    print([N])
else:
    print([N + 1])

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

if N % 2 = 0:
    print(N)
else:
    print(N + 1)

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

if N % 2 = 0:
    print(int(N))
else:
    print(int(N + 1))
Problem p02753 (python)

Fixed submission:
s = input()
if s[0] == s[1] and s[1] == s[2]:
    print ('No')
else: 
    print ('Yes')

Buggy submission (verdict: Runtime Error):
s = input()
if s[0] == s[1] and s[1] == s[2]:
    print 'no'
    else: print 'yes'

Buggy submission (verdict: Runtime Error):
s = input()
if s[0] == s[1] and s[1] == s[2]:
    print 'no'
    else: print 'yes'
Problem p02759 (python)

Fixed submission:
N = input()
M = int(N)
jud = M % 2
if jud == 1:
    ans = M // 2 + 1
else:
    ans = M // 2
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
ans = (N + 1) / 2
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
jud = N % 2
if jud == 1:
    ans = N // 2 + 1
else:
    ans == N / 2
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
jud == N % 2
if jud == 1:
    ans = N // 2 + 1
else:
    ans == N / 2
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
ans = (N + 1) // 2
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
ans = N // 2
print(ans)