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

Fixed submission:
a,b,c = map(int, input().split())
d,e,f = abs(b-a),abs(c-b),abs(a-c)
ans = 0
if a % 2 == 1 or b % 2 == 1 or c % 2 == 1:
  print(0)
else: 
  if d == e and e == f:
    print(-1)
  else:
    while d % 2 == 0 and e % 2 == 0 and f % 2 == 0:
      ans += 1
      d //= 2
      e //= 2
      f //= 2
    print(ans)

Buggy submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
d,e,f = abs(b-a),abs(c-b),abs(a-c)
ans = 0
if d == e and e == f:
  print(-1)
else:
  while d % 2 == 0 and e % 2 == 0 f % 2 == 0:
    ans += 1
    d //= 2
    e //= 2
    f //= 2
  print(ans)

Buggy submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
d,e,f = abs(b-a),abs(c-b),abs(a-c)
if d == e and e == f:
  print(-1)
ans = 0
else:
  while d % 2 == 0 and e % 2 == 0 f % 2 == 0:
    ans += 1
    d //= 2
    e //= 2
    f //= 2
  else:
    print(ans)
Problem p03724 (python)

Fixed submission:
n,m = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(m)]
s = [0] * (10 ** 5+1)
for a,b in ab:
  s[a] += 1
  s[b] += 1
if any([i % 2 for i in s]):
  print("NO")
else:
  print("YES")

Buggy submission (verdict: Runtime Error):
n,m = map(int, input().split())
ab = list(map(int, input().split()))
s = [0] * (10 ** 5+1)
for a,b in ab:
  s[a] += 1
  s[b] += 1
if any([s % 2 for i in s]):
  print("NO")
else:
  print("YES")
Problem p03776 (python)

Fixed submission:
from functools import reduce
from operator import mul

def cmb(n, r):
    r = min(n - r, r)
    if r == 0:
        return 1
    return reduce(mul, range(n, n - r, -1)) // reduce(mul, range(r, 0, -1))

n,a,b = map(int, input().split())
v = list(map(int, input().split()))
v.sort(reverse = True)
if v[0] == v[a-1]:
  print(v[0])
  c = v.count(v[a-1])
  ans = 0
  for i in range(a,min(c+1,b+1)):
    ans += cmb(c,i)
  print(ans)
else:
  print(sum(v[:a]) / a)
  c = v.count(v[a-1])
  d = 0
  for key,value in enumerate(v):
    if value == v[a-1]:
      d = key
      break
  print(cmb(c,a-d))

Buggy submission (verdict: Runtime Error):
from functools import reduce
from operator import mul
import bisect

def cmb(n, r):
    r = min(n - r, r)
    if r == 0:
        return 1
    return reduce(mul, range(n, n - r, -1)) // reduce(mul, range(r, 0, -1))

n,a,b = map(int, input().split())
v = list(map(int, input().split()))
v.sort(reverse = True)
if v[0] == v[a-1]:
  print(v[0])
  c = v.count(v[a-1])
  ans = 0
  for i in range(a,b+1):
    ans += cmb(c,i)
  print(ans)
else:
  print(sum(v[:a]) / a)
  c = v.count(v[a-1])
  d = 0
  for key,value in enumerate(v):
    if value == v[a-1]:
      d = key
      break
  print(cmb(c,a-d))
Problem p03785 (python)

Fixed submission:
n,c,k = map(int, input().split())
t = [int(input()) for i in range(n)]
t.sort()
now = t[0]
people = 1
ans = 1
for i in t[1:]:
  if i - now > k or people >= c:
    now = i
    people = 1
    ans += 1
  else:
    people += 1
print(ans)

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

for i in range(n):
  if i == 1:
    if a == b:
      print(n)
      exit()
  if a[i:] == b[:-i]:
    print(n+i)
    exit()
print(n*2)
Problem p02699 (python)

Fixed submission:
s, w = input().split()
if int(w) >=  int(s):
  print('unsafe')
else:
  print('safe')

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
  c -= b
  if c > 0:
    a -= d
  else:
    print('Yes')
  if a <= 0
    print('No')

Buggy submission (verdict: Runtime Error):
s, w = input().split()
if int(w) >=  int(s):
  print('unsafe')
elif:
  print('safe')

Buggy submission (verdict: Runtime Error):
s, w = map(int, input().split())
if w >=  s:
  print('unsafe')
elif:
  print('safe')

Buggy submission (verdict: Runtime Error):
s, w = map(str, input().split())
if w >=  s:
  print('unsafe')
elif:
  print('safe')

Buggy submission (verdict: Runtime Error):
s, w = map(str(), input().split())
if w >=  s:
  print('unsafe')
elif:
  print('safe')
Problem p02723 (python)

Fixed submission:
s = input()
if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
s = input()
if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No)

Buggy submission (verdict: Runtime Error):
s = input()
if s[3] == s[4] and s[5] == s[6]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
s = input()
if s[3] == s[4] and s[5] = s[6]:
  print('Yes')
else:
  print('No')
Problem p02552 (python)

Fixed submission:
x=int(input())

if x==1:
  print("0")
else:
  print("1")

Buggy submission (verdict: Runtime Error):
x=int(input())
if x==1:
  print("0")
else:
  print("1!)
Problem p02570 (python)

Fixed submission:
a=input().split()
if int(a[0])>int(a[1])*int(a[2]):
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
a=input().split()
if int(a[0])>int(a[1])*int(a[2]):
  print("No")
else:
print("Yes")
Problem p02596 (python)

Fixed submission:
k=int(input())
a=0
for i in range(k):
  a=(a*10+7)%k
  if a==0:
    print(i+1)
    exit()
    
print(-1)

Buggy submission (verdict: Runtime Error):
k=int(input())
count=1
if k%2==0:
  print(-1)
else:
  while True:
    if a%k==0:
      print(count)
      break
    else:
      a=a*10+7
      count+=1
Problem p03012 (python)

Fixed submission:
N = int(input())
M = list(map(int, input().split()))
ans = sum(M)

for T in range(1, N):
    ans = min(abs(sum(M[0:T]) - sum(M[T:N])), ans)

print(ans)

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

for T in range(N-1):
    tmp = abs(sum(W[1:T]) - sum(W[T:N]))
    if ans > tmp:
        ans = tmp
 
print(ans)
Problem p03127 (python)

Fixed submission:
import sys
import fractions
from collections import deque

input = sys.stdin.readline

N = int(input())
a = [int(x) for x in input().rstrip("\n").split()]
q = deque(a)

while len(q) > 1:
    x = q.popleft()
    y = q.popleft()
    z =  fractions.gcd(x, y)
    q.append(z)

ans = q.popleft()
print(ans)

Buggy submission (verdict: Runtime Error):
import sys
from fractions import gcd
from collections import deque

input = sys.stdin.readline

N = int(input())
a = [int(x) for x in input().rstrip("\n").split()]
q = deque(a)

while len(q) > 1:
    x = q.popleft()
    y = q.popleft()
    z =  fractions.gcd(x, y)
    q.append(z)

ans = q.popleft()
print(ans)

Buggy submission (verdict: Runtime Error):
import sys
from fractions import math
from collections import deque

input = sys.stdin.readline

N = int(input())
a = [int(x) for x in input().rstrip("\n").split()]
q = deque(a)

while len(q) > 1:
    x = q.popleft()
    y = q.popleft()
    z =  math.gcd(x, y)
    q.append(z)

ans = q.popleft()
print(ans)

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

input = sys.stdin.readline

N = int(input())
a = [int(x) for x in input().rstrip("\n").split()]
q = deque(a)

while len(q) > 1:
    x = q.popleft()
    y = q.popleft()
    z =  math.gcd(x, y)
    q.append(z)

ans = q.popleft()
print(ans)

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

input = sys.stdin.readline

N = int(input())
a = [int(x) for x in input().rstrip("\n").split()]
q = deque(a)

while len(q) > 1:
    x = q.popleft()
    y = q.popleft()
    z =  math.gcd(x, y)
    q.append(z)

ans = q.popleft()
print(ans)

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

input = sys.stdin.readline

N = int(input())
a = [int(x) for x in input().split()]
q = deque(a)

while len(q) > 1:
    x = q.popleft()
    y = q.popleft()
    z =  math.gcd(x, y)
    q.append(z)

ans = q.popleft()
print(ans)
Problem p03207 (python)

Fixed submission:
N = int(input())
items = []
for _ in range(N):
    item = int(input())
    items.append(item)

items.sort()

print(int(sum(items[0:N-1]) + items[-1]/2))

Buggy submission (verdict: Runtime Error):
N = int(input())
items = []
for _ in range(N):
    item = int(input())
    items.append(item)

items.sort()

print(int(sum(items[0:N-1]) + items[N]/2))
Problem p03250 (python)

Fixed submission:
a = sorted(map(int, input().split()))
print(a[-1] * 10 + a[0] + a[1])

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

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

iteration = len(S) - len(T) + 1

if T in S:
    ans = 0
else:
    minimum = len(T)
    for i in range(iteration):
#         print('---------------')
        s = S[i:len(T)+i]
#         print(s)
#         print(T)
        count = 0
        for j in range(len(T)):
            if s[j] != T[j]:
                count += 1
#             print(count)
        minimum = min(minimum, count)
    ans = minimum
    
print(ans)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

if T in S:
    ans = 0
else:
    for i in range(1, len(T)):
#         print(T[i:])
#         print(T[:-i])
#         print('--------------')
        if T[i:] in S or T[:-i] in S:
            ans = i
            break
print(ans)
Problem p02623 (python)

Fixed submission:
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

a, b = [0], [0]
for i in range(N):
    a.append(a[i] + A[i])
for i in range(M):
    b.append(b[i] + B[i])

ans, j = 0, M

for i in range(N + 1):
    if a[i] > K:
        break
    while b[j] > K - a[i]:
        j -= 1
    ans = max(ans, i + j)
print(ans)

Buggy submission (verdict: Runtime Error):
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

a, b = [0], [0]
for i in range(N):
    a.append(a[i] + A[i])
for i in range(M):
    b.append(a[i] + A[i])

ans, j = o, M

for i in range(N + 1):
    if a[i] > K:
        break
    while b[j] > K - a[i]:
        j -= 1
    ans = max(ans, i + j)
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import deque


n, m, k = map(int, input().split())

A = deque(int(a) for a in input().split())
B = deque(int(b) for b in input().split())

ans = 0
while (len(A) or len(B)) and k:
    a = A[0] if len(A) else k + 1
    b = B[0] if len(B) else K + 1
    if a >= b:
        if k - b >= 0:
            k -= B.popleft()
            ans += 1
            continue
        else:
            break
    else:
        if k - a >= 0:
            k -= A.popleft()
            ans += 1
            continue
        else:
            break

print(ans)
Problem p02891 (python)

Fixed submission:

def main():
    s = input()
    k = int(input())
    print(solve(s, k))

def solve(s, k):
    ans = 0
    if len(set(s)) == 1:
        ans += replace_count(len(s)*k)
    else:
        same = 1
        for i in range(0, len(s)-1):
            if s[i] == s[i+1]:
                same += 1
            else:
                ans += replace_count(same) * k
                same = 1
        ans += replace_count(same) * k
        if s[0] == s[i]:
            a = 1
            b = 1
            a_idx = 0
            b_idx = -1
            while s[a_idx] == s[a_idx+1]:
                a += 1
                a_idx += 1
            while s[b_idx] == s[b_idx-1]:
                b += 1
                b_idx -= 1
            dup = (replace_count(a) + replace_count(b) - replace_count(a+b)) * (k-1)
            ans -= dup

    return ans


def replace_count(n):
    return n//2

main()

Buggy submission (verdict: Runtime Error):

def main():
    s = input()
    k = int(input())
    print(solve(s, k))

def solve(s, k):
    ans = 0
    if len(set(s)) == 1:
        ans += replace_count(len(s)*k)
    else:
        # 接続部分
        start = 1
        end = 0
        i = 1
        # issii
        while (s[0] == s[i]):
            i +=1
            start +=1
        j = -1
        while (s[0] == s[j]):
            j -=1
            end +=1
        ans += replace_count(start+end) * (k-1)
        ans += replace_count(start) 
        ans += replace_count(end) 

        # 単語内部
        same = 1
        for idx in range(i, len(s)+j+1):
            if idx >= len(s):
                break
            if s[idx] == s[idx+1]:
                same += 1
            else:
                ans += replace_count(same) * k
                same = 1
    return ans


def replace_count(n):
    return n//2

main()

Buggy submission (verdict: Runtime Error):

def main():
    s = input()
    k = int(input())
    print(solve(s, k))

def solve(s, k):
    ans = 0
    if len(set(s)) == 1:
        ans += replace_count(len(s)*k)
    else:
        # 接続部分
        start = 1
        end = 0
        i = 1
        # issii
        while (s[0] == s[i]):
            i +=1
            start +=1
        j = -1
        while (s[0] == s[j]):
            j -=1
            end +=1
        ans += replace_count(start+end) * (k-1)
        ans += replace_count(start) 
        ans += replace_count(end) 

        # 単語内部
        same = 1
        for idx in range(i, len(s)+j+1):
            if s[idx] == s[idx+1]:
                same += 1
            else:
                ans += replace_count(same) * k
                same = 1
    return ans


def replace_count(n):
    return n//2

main()
Problem p02552 (python)

Fixed submission:
x=int(input())
if x==0:
  print(1)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
x=input()
if x==0:
  print(1)
else if x==1:
  print(0)
Problem p02777 (python)

Fixed submission:
def remaining_ball():
    S,T=map(str,input().split())
    A,B=map(int,input().split())
    U=input()
    if U==S:
        A-=1
    else:
        B-=1
    print(A,B)
remaining_ball()

Buggy submission (verdict: Runtime Error):
ef remaining_ball():
    S,T=map(str,input().split())
    A,B=map(int,input().split())
    U=input()
    if U==S:
        A-=1
    else:
        B-=1
    print(A,B)
remaining_ball()
Problem p02552 (python)

Fixed submission:
n = int(input())
print(0 if n == 1 else 1)

Buggy submission (verdict: Runtime Error):
n = int(input())
return 0 if n == 1 else n
Problem p02571 (python)

Fixed submission:

import random, string
S = input()
T = input()
l = len(T)
L = len(S)
max_ans = -1
for i in range(L):
   ans = 0
   if i + l > L:
      continue
   for j in range(l):
      if T[j] == S[i + j]:
            ans += 1
   max_ans = max(max_ans, ans)
print(l - max_ans)

Buggy submission (verdict: Runtime Error):
import random, string
def randomname(n):
   randlst = [random.choice(string.ascii_letters + string.digits) for i in range(n)]
   return ''.join(randlst)
S = input()
T = input()
l = len(T)
L = len(S)
before = randomname(l)
after = randomname(l)
for i in range(l):
   before[i] = '.'
   after[i] = '.'
S = before + S + after
max_ans = -1
for i in range(L+l+1):
   for j in range(l):
      ans = 0
      if T[j] == S[i + j]:
         ans += 1
   max_ans = max(max_ans, ans)
print(l - max_ans)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()
l = len(T)
L = len(S)
max_ans = -1
for i in range(l):
   for j in range(l-i):
      ans = 0
      if T[i+j] == S[j]:
         ans += 1
   max_ans = max(max_ans, ans)
for i in range(L - l):
   for j in range(l):
      ans = 0
      if T[j] == S[j+i]:
         ans += 1
      max_ans = max(max_ans, ans)
for i in range(l):
    for j in range(i):
       if T[i-j] == S[L-j]:
          ans +=1
       max_ans = max(max_ans, ans)
print(l - max_ans)
Problem p02572 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
sum = 0
ans = 0
for i in range(1, N):
   sum +=A[i-1]
   sum = sum % (10**9 + 7)
   ans = ans + (sum * A[i]) % (10**9 + 7)
   ans = ans % (10**9 + 7)
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
sum = 0
for i in range(1, N):
   sum +=A[i-1]
   sum = sum % (10**9 + 7)
   ans = ans + (sum * A[i]) % (10**9 + 7)
   ans = ans % (10**9 + 7)
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
sum = 0
for i in range(1, N):
   sum +=A[i-1]
   sum = sum % (10**9 + 7)
   ans += (sum * A[i]) % (10**9 + 7)
print(ans)
Problem p02594 (python)

Fixed submission:
X = int(input())
if X > 29:
   print('Yes')
else:
   print('No')

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
A = sorted(map(int,input().split()))
start = 0
end = A[-1]
while end - start != 0:
   l = (start + end)/2
   count = 0
   for i in range(N):
      count += (A[i]-1)//l
   if count > K:
      start = int(l)
   else:
      end = int(l+1)
print(int(l)+1)
Problem p02595 (python)

Fixed submission:
import sys
N, D = map(int,input().split())
count = 0
for s in sys.stdin.readlines():
   X, Y = map(int, s.split())
   if X**2+Y**2 <= D**2:
      count += 1
print(count)

Buggy submission (verdict: Runtime Error):
import sys
N, D = map(int,input().split())
count = 0
for s in sys.stdin.readlines():
   X, Y = map(int, s.split())
   X = X / D
   Y = Y / D
   if X**2+Y**2 <= 1:
      count += 1
print(count)
Problem p02596 (python)

Fixed submission:
K = int(input())
r = 7 % K
ans = -2
for i in range(K):
   if r == 0:
      ans = i
      break
   r = 10*r + 7
   r = r % K
print(ans+1)

Buggy submission (verdict: Runtime Error):
K = int(input())
r = 7 % K
ans = -1
for i in range(K):
   if r == 0:
      ans = i
      break
   r = 10r + 7
   r = r % K
print(ans)
Problem p02597 (python)

Fixed submission:
N = int(input())
stone = input()
R = stone.count('R')
ans = stone.count('W', 0, R)
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
stone = list(map(input().split()))
R = stone.count('R')
ans = stone.count('W', 0, R-1)
print(ans)
Problem p02598 (python)

Fixed submission:
N, K = map(int,input().split())
A = list(map(int,input().split()))
start = 0
end = 10**9
while end - start > 1:
   l = (start + end)/2
   l = int(l)
   count = 0
   for i in range(N):
      q = A[i]/l
      if q == int(q):
         q -= 1
      count += int(q)
   if count <= K:
      end = l
   else:
      start = l
print(end)

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
A = map(int,input().split())
start = 0
end = max(A)
while end - start > 1:
   l = (start + end)/2
   l = int(l)
   count = 0
   for i in range(N):
      q = A[i]/l
      if q == int(q):
         q -= 1
      count += int(q)
   if count <= K:
      end = l
   else:
      start = l
print(end)

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
A = sorted(map(int,input().split()))
start = 0
end = A[-1]
l = (start + end)/2
l = int(l)
while end - start >= 1:
   l = (start + end)/2
   l = int(l)
   count = 0
   for i in range(N):
      q = A[i]/l
      if q == int(q):
         q -= 1
      count += int(q)
   if count > K:
      start = l
   else:
      end = l
ans = (start + end)/2
print(ans)

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
A = sorted(map(int,input().split()))
start = 0
end = A[-1]
l = (start + end)/2
while int(end) - start >= 0:
   l = (start + end)/2
   count = 0
   for i in range(N):
      q = A[i]/l
      if q = int(q):
         q -= 1
      count += int(q)
   if count > K:
      start = l
   else:
      end = l
ans = (start + end)/2
print(int(end))

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
A = sorted(map(int,input().split()))
start = 0
end = A[-1]
l = (start + end)/2
while int(end) - int(start) >= 1:
   l = (start + end)/2
   count = 0
   for i in range(N):
      q, mod = divmod(A[i], l)
      if mod == 0.0;
         q -= 1
      count += q
   if count > K:
      start = l
   else:
      end = l
ans = (start + end)/2
print(int(end)+1)

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
A = sorted(map(int,input().split()))
start = A[0]
end = A[-1]
while start > end:
   l = (start + end)/2
   count = 0
   for i in range(N):
      count += A[i]//l + 1
   if count > K:
      start = l
   else:
      end = l
print(l)
Problem p02659 (python)

Fixed submission:
A,B= list(input().split())
a = int(B[0])
b = int(B[2])
c = int(B[3])
if int(A) > 1000:
   e = int(A[-2])
   f = int(A[-1])
   d = int((int(A)- 10 * e - f)/100)
   error = 10 * (c * e + b * f) + c * f
   error = int(error/100)
   ans = int(A) * a + 10 * d * b + e * b + c * d + error
   print(int(ans))
else:
   print(int(int(A)*float(B)))

Buggy submission (verdict: Runtime Error):
A,B= list(input().split())
a = int(B[0])
b = int(B[2])
c = int(B[3])
if int(A) > 1000:
   e = int(A[-2])
   f = int(A[-1])
   d = (int(A)- 10 * e - f)/100
   error = 10 * (c * e + b * f) + c * f
   error = int(error/100)
   ans = int(A) * a + 10 * d * b + e * b + c * d + error
   print(ans)
else:
   print(int(int(A)*float(B))

Buggy submission (verdict: Runtime Error):
A,B= list(input().split())
a = int(B[0])
b = int(B[2])
c = int(B[3])
e = int(A[-2])
f = int(A[-1])
d = (int(A)- 10*e - f)/100
error = 10 * (c * e + b * f) + c * f
error = int(error/100)
ans = int(A) * a + 10 * d * b + e * b + c * d + error
print(ans)

Buggy submission (verdict: Runtime Error):
A,B= list(input().split())
a = int(B[0])
b = int(B[2])
c = int(B[3])
d = int(A[0])
e = int(A[1])
f = int(A[2])
error = 10 * (c * e + b * f) + c * f
error = int(error/100)
ans = int(A) * a + 10 * d * b + e * b + c * d + error
print(ans)
Problem p02570 (python)

Fixed submission:
d,s,t = map(int,input().split())
print('Yes' if d/s <= t else 'No')

Buggy submission (verdict: Runtime Error):
D = int(input()), T = int(input()), S = int(input())

travel_time = D * S
if travel_time <= T:
  print "yes"
  else: print "no"

Buggy submission (verdict: Runtime Error):
D = int(input())
T = int(input())
S = int(input())

travel_time = D * S
if travel_time <= T:
  print "yes"
  else: print "no"
Problem p02594 (python)

Fixed submission:
x = int(input())
if x >= 30:
  print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
x = int(input())
if x >= 30:
  print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
x = int(input())
if x >= 30:
  print("yes")
  else:
    print("No")
Problem p02627 (python)

Fixed submission:
alpha = input()
print('A' if alpha.isupper() else 'a')

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
price = 0

for i in range(k):
  price += p[i]
  
print(price)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
price = 0

for i in range(k):
	  price += p[i]
  
print(price)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
ans = 0

for i in range(k):
  ans += p[i]
  
print(ans)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
price = 0

for i in range(k):
  price += p[i]
  
print(price)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
price = 0
for i in range(k):
  price += p[i]
print(price)
Problem p02711 (python)

Fixed submission:
n = input()

if "7" in n:
    print("Yes")
else:
    print("No")

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

if "7" in n:
    print("Yes")
else:
    print("No")
Problem p02777 (python)

Fixed submission:
s, t = input().split()
a, b = map(int, input().split())
u = str(input())
 
if u==s:
  print(a-1, b)
else:
  print(a, b-1)

Buggy submission (verdict: Runtime Error):
s, t = input().split()
a, b = map(int, input().split())
u = str(input())
 
if u = s:
  print(a-1, b)
else:
  print(a, b-1)

Buggy submission (verdict: Runtime Error):
s, t = map(str, input().split())
a, b = map(int, input().split())
u = str(input())

if u = s:
  print(a-1, b)
else:
  print(a, b-1)
Problem p03803 (python)

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

if int(a) == 1 and int(b) != 1:
    print("Alice")
elif int(a) != 1 and int(b) == 1:
    print("Bob")
elif int(a) > int(b):
    print("Alice")
elif int(a) < int(b):
    print("Bob")
elif int(a) == int(b):
    print("Draw")

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
if a > b or a = 1:
  print("Alice")
elif b > a or b = 1:
  print("Bob")