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

Fixed submission:
Q,H,S,D = map(int,input().split())
N = int(input())
h = min(2*Q,H)
s = min(2*h,S)
d = min(2*s,D)
print((N//2)*d + (N%2)*s)

Buggy submission (verdict: Runtime Error):
Q,H,S,D = map(int,input().spllit())
N = int(input())

h = min(H , 2*Q)
s = min(2*h,S)
d = min(2*s,D)

if N % 2 == 0:
  print((N//2 * d))
else:
  print((N//2)*d + s)

Buggy submission (verdict: Runtime Error):
Q,H,S,D = map(int,input().spllit())
N = int(input())

h = min(H , 2*Q)
s = min(2*h,S)
d = min(2*s,D)

if N % 2 == 0:
  print((N//2 * d))
else:
  print((N//2)*d + s)

Buggy submission (verdict: Runtime Error):
Q,H,S,D = map(int,input().spllit())
N = int(input())

h = min(H , 2*Q)
s = min(2*h,S)
d = min(2*s,D)

print((N//2)*d + (N%2)*s)

Buggy submission (verdict: Runtime Error):
Q,H,S,D = map(int,input().spllit())
N = int(input())

h = min(2*Q,H)
s = min(2*h,S)
d = min(2*s,D)

print((N//2)*d + (N%2)*s)

Buggy submission (verdict: Runtime Error):
Q,H,S,D = map(int,input().spllit())
N = int(input())

h = min(2*Q,H)
s = min(2*h,S)
d = min(2*s,D)

print((N//2)*d + (N%2)*s)

Buggy submission (verdict: Runtime Error):
m = input().split()
Q = int(m[0])
H = int(m[1])
S = int(m[2])
D = int(m[3])
N = int(input())

list_1 = [S, 2*H, 4*D]
list_1.sort()

min_1 = list[0]

if D < (min_1 * 2):
  total_cost = D * (N // 2) + min_1 * (N % 2)
else:
  total_cost = min_1 * N

print(total_cost)

Buggy submission (verdict: Runtime Error):
m = input().split()
Q = int(m[0])
H = int(m[1])
S = int(m[2])
D = int(m[3])
N = int(input())

list_1 = [S, 2*H, 4*D]
list_1.sort()

min_1 = list[0]

if D < (min_1 * 2):
  total_cost = D * (N // 2) + min_1 * (N % 2)
else:
  total_cost = min_1 * N

print(total_cost)
Problem p02570 (python)

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

if t*s>=d:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
d=input()
t=input()
s=input()

if d<=s*t:
  print("Yes")
else print("No")
Problem p02547 (python)

Fixed submission:
n=int(input())
c=0
count=0
for i in range(n):
    a,b=map(int,input().split())

    if a==b:
        count+=1
    else:
        count=0
    if count==3:
        c=1
if c==1:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
c=1
for i in range(n):
    a,b=map(int,input().split())
    if a==b:
        count+=1
    else:
        count=0
    if count==3:
        c=1
if c==1:
    print("Yes")
else:
    print("No")
Problem p02577 (python)

Fixed submission:
s=str(input())
ans=0
for i in s:
    ans+=int(i)
if ans%9==0:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=int(input())
for i in s:
    ans+=int(i)
if ans%9==0:
    print("Yes")
else:
    print("No")
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):
a,b,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
s=0
c=0
while t>s:
    if l1[0]>l2[0]:
        s+=l2.pop(0)
    else:
        s+=l1.pop(0)
    c+=1
if s>t:
    print(c-1)
else:
    print(c)
Problem p02711 (python)

Fixed submission:
n=int(input())
c=0
while n!=0:
    s=n%10
    if s==7:
        c=1
        break
    n=n//10
if c==0:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
import collections
n=int(input())
s=str(input())
d=collections.defaultdict(list)
count=0
v=collections.defaultdict(int)
for i in range(n):
    d[s[i]].append(i)
for i in range(len(d["R"])):
    for j in range(i,len(d["G"])):
        if j>i:
            for k in range(j,len(d["B"])):
                if k>j:
                    if j-i!=k-j:
                        count+=1
for i in range(len(d["R"])):
    for j in range(i,len(d["B"])):
        if j>i:
            for k in range(j,len(d["G"])):
                if k>j:
                    if j-i!=k-j:
                        count+=1
for i in range(len(d["G"])):
    for j in range(i,len(d["R"])):
        if j>i:
            for k in range(j,len(d["B"])):
                if k>j:
                    if j-i!=k-j:
                        count+=1
for i in range(len(d["G"])):
    for j in range(i,len(d["B"])):
        if j>i:
            for k in range(j,len(d["R"])):
                if k>j:
                    if j-i!=k-j:
                        count+=1
for i in range(len(d["B"])):
    for j in range(i,len(d["R"])):
        if j>i:
            for k in range(j,len(d["G"])):
                if k>j:
                    if j-i!=k-j:
                        count+=1
for i in range(len(d["B"])):
    for j in range(i,len(d["G"])):
        if j>i:
            for k in range(j,len(d["R"])):
                if k>j:
                    if j-i!=k-j:
                        count+=1
                #v[(i,j,k)]+=1
print(count)
#print(v)
#print(len(v))
Problem p02860 (python)

Fixed submission:
n=int(input())
s=str(input())
if n%2!=0:
    print("No")
else:
    if s[:n//2]==s[n//2:]:
        print("Yes")
    else:
        print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
s=str(input())
if s[:n//2]==s[n//2:]:
  print("Yes")
 else:
  print("No")
Problem p03042 (python)

Fixed submission:
s=input()
if (int(s[0]+s[1])>12 or int(s[0]+s[1])==00) and int(s[2]+s[3])<=12 and int(s[2]+s[3])!=00:
    print("YYMM")
elif int(s[0]+s[1])<=12 and( int(s[2]+s[3])>12 or int(s[2]+s[3])==00) and int(s[0]+s[1])!=00:
    print("MMYY")
elif int(s[0]+s[1])<=12 and int(s[2]+s[3])<=12 and (int(s[0]+s[1])!=00 or int(s[2]+s[3])!=00):
    print("AMBIGUOUS")
else:
    print("NA")

Buggy submission (verdict: Runtime Error):
s=input()
if (int(s[0]+s[1])>12 or  or int(s[0]+s[1])==00) and int(s[2]+s[3])<=12 and int(s[2]+s[3])!=00:
    print("YYMM")
elif int(s[0]+s[1])<=12 and( int(s[2]+s[3])>12 or int(s[2]+s[3])==00) and int(s[0]+s[1])!=00:
    print("MMYY")
elif int(s[0]+s[1])<=12 and int(s[2]+s[3])<=12 and (int(s[0]+s[1])!=00 or int(s[2]+s[3])!=00):
    print("AMBIGUOUS")
else:
    print("NA")
Problem p02633 (python)

Fixed submission:
n=int(input())
k=1
while k>0:
  if k*n%360==0:
       print(k)
       break
  else:
       k+=1

Buggy submission (verdict: Runtime Error):
n=int(input())
print(ceil(360/n))
Problem p02547 (python)

Fixed submission:
n = int(input())
d = [map(int, input().split()) for _ in range(n)]
d1, d2 = [list(i) for i in zip(*d)]

count = 0
flag = 0
for i in range(n):
  if d1[i]==d2[i]:
    count += 1
  else:
    count = 0
  if count==3:
    flag = 1
    print('Yes')
    break

if flag==0:
  print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
d = [map(int, input().split()) for _ in range(5)]
d1, d2 = [list(i) for i in zip(*d)]

count = 0
flag = 0
for i in range(n):
  if d1[i]==d2[i]:
    count += 1
  else:
    count = 0
  if count == 3:
    flag = 1
    print('Yes')
    break

if flag==0:
  print('No')
Problem p02572 (python)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
sum = 0
m = 10**9+7

for i in range(n):
  sum = sum+a[i]

#sum = sum%m
#sum = sum*sum
ans = 0
for i in range(n):
  ans = ans + sum*a[i]
  ans = ans - a[i]*a[i]
ans = ans//2%m

print(ans)

Buggy submission (verdict: Runtime Error):
import numpy as np
n = int(input())
a = list(map(int,input().split()))
sum = 0
aa = np.array(a).reshape(1,n)
mat = np.dot(aa.T,aa)
s = np.sum(mat)
for i in range(n):
  s -= a[i]*a[i]
sum = int(s/2)
sum = sum % (10**9+7)

print(sum)
Problem p02570 (python)

Fixed submission:
D, T, S = map(int, input().split())
print('No' if (D / T) > S else 'Yes')

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
sum_ = 0
for i in range(N):
    for j in range(i, N):
        sum_ += A[i] * A[j]
        sum_ %= 1_000_000_007

print(sum_)
Problem p02572 (python)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
tmp = sum(A)
sum_ = 0

for a in A:
    tmp -= a
    sum_ += a * tmp

print(sum_ % (1_000_000_007))

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

sum_ += sum(a * (tmp - a) for a in A)

print(sum_)
Problem p02578 (python)

Fixed submission:
N = input()
A = map(int, input().split())
sum = 0
pre = 0
for ai in A:
  if pre > ai:
    sum += pre - ai
  else:
    pre = ai
print(sum)

Buggy submission (verdict: Runtime Error):
N = input()
A = map(int, input().split())
sum = 0
pre = 0
for ai in A:
  if pre > ai:
    sum += pre - ai
  else:
    pre = ai
print(sum
Problem p02547 (python)

Fixed submission:
N = int(input())
D = 0

for i in range(N):
    D1, D2 = map(int, input().split())
    if D == 3:
        break

    if D1 == D2:
        D += 1

    elif D1 != D2:
        D = 0

if D == 3:
    print('Yes')
else:
    print('No')

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

for i in range(N + 1):
    D1, D2 = map(int, input().split())
    if D == 3:
        break

    if D1 == D2:
        D += 1

    elif D1 != D2:
        D = 0

if D == 3:
    print('Yes')
else:
    print('No')
Problem p02571 (python)

Fixed submission:
S = input()
T = input()
s = len(S)
t = len(T)
l1 = [] 
l2 = []
n = 0
for i in range(n, s-t+1): 
    ss = S[n:t + n]
    n += 1
    m = 0
    for x in ss:       
        if x == T[m]:
            l1.append(1)
            m +=1
        elif x != T[m]:
            l1.append(0)
            m +=1   
    l2.append(sum(l1))
    l1 = [ ]
print(t - max(l2))

Buggy submission (verdict: Runtime Error):
S, T = list(input().split())
s = len(S)
t = len(T)
l1 = [] 
l2 = []
n = 0
for i in range(n, s-t+1): 
    ss = S[n:t + n]
    n += 1
    m = 0
    for x in ss:       
        if x == T[m]:
            l1.append(1)
            m +=1
        else:
            l1.append(0)
            m +=1   
    l2.append(sum(l1))
    l1 = []
print(t - max(l2))

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# coding: utf-8

# In[55]:


S, T = list(input().split())
s = len(S)
t = len(T)
l1 = [] 
l2 = []
n = 0


for i in range(n, s-t+1): 
    ss = S[n:t + n]
    n += 1
    m = 0
    for x in ss:
        
        if x == T[m]:
            l1.append(1)
            m +=1
        else:
            l1.append(0)
            m +=1
    
    l2.append(sum(l1))
    l1 = []
    
print(t - max(l2))


# In[ ]:

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# coding: utf-8

# In[48]:


S, T = list(input().split())
s = len(S)
t = len(T)
list1 = [] 
list2 = []
n = 0


for i in range(n, s-t+1): 
    ss = S[n:t + n]
    n += 1
    m = 0
    for x in ss:
        
        if x == T[m]:
            list1.append(1)
            m +=1
        else:
            list1.append(0)
            m +=1
    
    list2.append(sum(list1))
    list1 = []
   
print(t - max(list2))


# In[ ]:

Buggy submission (verdict: Runtime Error):
S, T = list(input().split())
s = len(S)
t = len(T)
list1 = [] 
list2 = []
n = 0


for i in range(n, s-t+1): 
    ss = S[n:t + n]
    n += 1
    m = 0
    for x in ss:
        
        if x == T[m]:
            list1.append(1)
            m +=1
        else:
            list1.append(0)
            m +=1
    
    list2.append(sum(list1))
    list1 = []
   
print(t - max(list2))

Buggy submission (verdict: Runtime Error):
S, T = list(input().split())
s = len(S)
t = len(T)
list1 = [] 
list2 = []
n = 0


for i in range(n, s-t+1): 
    ss = S[n:t + n]
    n += 1
    m = 0
    for x in ss:
        
        if x == T[m]:
            list1.append(1)
            m +=1
        else:
            list1.append(0)
            m +=1
    
    print(list1)
    list2.append(sum(list1))
    list1 = []
   
print(t - max(list2))
Problem p02578 (python)

Fixed submission:
N = input()
A = list(map(int,input().split()))
raw =sum(A)
con = 0

if len(A) == 1:
    print(0)
    
else:
    for i in A:
        if A[con] > A[con+1]:
            A[con+1] =  A[con]
        
        if A[con+1] == A[-1]:
            break

        con += 1

    ans = sum(A) - raw
    print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
A = list(map(int,input().split()))
raw =sum(A)
con = 0

for i in A:
    if A[con] > A[con+1]:
        A[con+1] =  A[con]
        
    if A[con+1] == A[-1]:
        break

    con += 1

ans = sum(A) - raw
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
A = list(map(int,input().split()))
raw =sum(A)
con = 0

for i in A:
    if A[con] > A[con+1]:
        A[con+1] =  A[con]
        print(A)
        
    if A[con+1] == A[-1]:
        break

    con += 1

ans = sum(A) - raw
print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
A = list(map(int,input().split()))
raw =sum(A)
con = 0

for i in A:
    if A[con] > A[con+1]:
        A[con+1] =  A[con]
        
    if A[con+1] == A[-1]:
        break

    con += 1

print(A)
ans = sum(A) - raw
print(ans)
Problem p02570 (python)

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

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
result = 0
d = 0
for i in range(n):
  d += a[i] ** 2
result = int(((sum(a) % (10**9 + 7)) ** 2 - d) / 2)
result = result % (10**9 + 7)
print(result)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
result = 0
for i in range(n):
  for j in range(i + 1, n):
    result += a[i] * a[j]
result = result % (10**9 + 7)
print(result)
Problem p02572 (python)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
sum_a = 0
result = 0
for i in range(n):
  sum_a += a[i]
for j in range(n):
  sum_a -= a[j]
  result += sum_a * a[j]
print(result % (10**9 + 7))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
  for j in range(i + 1, n):
    result += (a[i] % (10**9 + 7)) * (a[i] % (10**9 + 7))
result = result % (10**9 + 7)
print(result)
Problem p02578 (python)

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
result = [0]
for i in range(n - 1):
    if a_list[i] + result[i] > a_list[i + 1]:
        result.append(a_list[i] + result[i] - a_list[i + 1])
    else:
        result.append(0)
print(sum(result))

Buggy submission (verdict: Runtime Error):
n = int(input())
a_list = list(map(int, input().split()))
result = [0]
for i in range(n - 1):
    if a_list[i] + result[i] > a_list[i + 1]:
        result.append(a_list[i] + result[i] - a_list[i + 1])
print(sum(result))
Problem p02695 (python)

Fixed submission:
# -*- coding: utf-8 -*-

class Combination_with_repetition():
    def getPattern(self, arr :list, r :int) -> list:
        self._selected=[]
        self._all_pattern=[]
        
        self._make(arr,r)
        return self._all_pattern
        
    def _make(self, arr :list, r :int):
        if r == 0:
            self._all_pattern.append(self._selected[:])
            return 
        
        for i in range(len(arr)):
            self._selected.append( arr[i] )
            self._make(arr[i:],r-1)
            
            self._selected.pop()  # Backtracking

#-----
N,M,Q = list(map(int, input().rstrip().split()))
abcd_list = [list(map(int, input().rstrip().split())) for i in range(Q)]

#-----
comb_rep = Combination_with_repetition()
pattern = comb_rep.getPattern( list(range(1, M+1)) , N)


max_sum = 0

for pat in pattern:
    tmp_sum = 0
    
    for a,b,c,d in abcd_list:
        if ( pat[b-1] - pat[a-1] ) == c:
            tmp_sum += d
    
    max_sum = max(max_sum, tmp_sum)

print(max_sum)

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

class Combination_with_repetition():
    def getPattern(self, arr :list, r :int) -> list:
        self._selected=[]
        self._all_pattern=[]
        
        self._make(arr,r)
        return self._all_pattern
        
    def _make(self, arr :list, r :int):
        if r == 0:
            self._all_pattern.append(self._selected[:])
            return 
        
        for i in range(len(arr)):
            self._selected.append( arr[i] )
            self._make(arr[i:],r-1)
            
            self._selected.pop()  # Backtracking

#-----
N,M,Q = list(map(int, input().rstrip().split()))
abcd_list = [list(map(int, input().rstrip().split())) for i in range(Q)]

#-----
comb_rep = Combination_with_repetition()
pattern = comb_rep.getPattern( list(range(1, M+1)) , M)


max_sum = 0

for pat in pattern:
    tmp_sum = 0
    
    for a,b,c,d in abcd_list:
        if ( pat[b-1] - pat[a-1] ) == c:
            tmp_sum += d
    
    max_sum = max(max_sum, tmp_sum)

print(max_sum)
Problem p02831 (python)

Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

def gcd(a,b):
  if a == 0:
    return b
  elif b == 0:
    return a
  else:
    return gcd(b,a % b)

a,b = map(int, input().split())
print(int(a / gcd(a,b) * b))

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
print(int(a / math.gcd(a,b) * b))
Problem p02835 (python)

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

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b,c = map(int, input().split())
if a + b + c >= 22:
  print('bust')
else:
  print('win')
Problem p02879 (python)

Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)

Buggy submission (verdict: Runtime Error):
# AtCoderでsympyがimportできるか

import math
import statistics
import numpy as np
import sympy as sym
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)

Buggy submission (verdict: Runtime Error):
import sympy as sym

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)
Problem p02880 (python)

Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n = int(input())
for a in range(1, 10):
  for b in range(1, 10):
    if(a * b == n):
      print('Yes')
      exit(0)
print('No')

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)
Problem p02970 (python)

Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n,d = map(int, input().split())
print((n + d * 2) // (d * 2 + 1))

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n,d = map(int, input().split())
print((n + d * 2) // (d * 2 + 1)
Problem p02829 (python)

Fixed submission:
a= int(input())
b= int(input())
c= 6
print(c-(a+b))

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

ans= ""
for i in range(n):
    ans=ans+s[i]+t[i]

print(ans)
Problem p02915 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list((map(int,input().split())))
B = list((map(int,input().split())))
C = list((map(int,input().split())))
 
total = sum(B)
point = 0
for i in range(len(A) - 1):
    if A[i] + 1 == A[i+1]:
        point = point+C[A[i-1]]
        print(point)
print(total+point)
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())))
 
total = sum(B)
for i in range(len(A) - 1):
    if A[i] + 1 == A[i+1]:    	
        total= total+C[A[i]-1]
      
print(total)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list((map(int,input().split())))
B = list((map(int,input().split())))
C = list((map(int,input().split())))
 
total = sum(B)
point = 0
for i in range(len(A) - 1):
    if A[i] + 1 == A[i+1]:
        point = point+C[A[i-1]]
        print(point)
print(total+point)
Problem p03041 (python)

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

S[K-1] = S[K-1].lower()
print("".join(S))

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

S[K-1] = S[K-1].lower()
print(S[0],S[1],S[2], sep="")
Problem p02933 (python)

Fixed submission:
a = 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:
    print("red")

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

if a >= 2300:
  print(s)
  else:
    print("red")

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

if a >= 2300:
  print(s)
  elif a < 3200:
    print("red")

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

if a >= 2300:
  print(s)
  else:
    print(a)

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

if a >= 2300:
  print(a)
  else:
    print(s)
Problem p02711 (python)

Fixed submission:
S = int(input())
if S // 100 == 7:
    print('Yes')
elif (S % 100) // 10 == 7:
    print('Yes')
elif (S % 100) % 10 == 7:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
S = input()
if S//100 == 7:
    print(Yes)
elif (S % 100) // 10 == 7:
    print(Yes)
elif (S % 100) % 10 == 7:
    print(Yes)
else:
    print(No)
Problem p02594 (python)

Fixed submission:
#ABC174A


X = int(input())

if X > 29:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
#ABC174A


X = int(input())

if X >= 30:
    peint('Yes')
else:
    print('No')
Problem p02595 (python)

Fixed submission:

#ABC174B

N,D = map(int,input().split())
X = []
Y = []
for _ in range(N):
    x,y = map(int,input().split())
    X.append(x)
    Y.append(y)

count = 0

for i in range(N):
    if D**2 >= X[i]**2 + Y[i]**2:
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):

#ABC174B

N,D = map(int,input.split())
X = []
Y = []
for _ in range(N):
    x,y = map(int,input().split())
    X.append(x)
    Y.append(y)

count = 0

for i in range(N):
    if D**2 >= X[i]**2 + Y[i]**2:
        count += 1
print(count)
Problem p02659 (python)

Fixed submission:
a,b =input().split()
a = int(a)
b = b.replace('.','')
print(a*int(b)//100)

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

b = int(b)*100

print((int(a)*b)//100)

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

b = int(b*100)

print((a*b)//100)