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

Fixed submission:
num = int(input())
l = list(map(int, input().split()))
count = 1
var = var2 = 0
c = l[0]
for i in l[1:]:
    if c < i:
        var = 1
    elif c > i:
        var2 = 1
    if var == 1 and var2 == 1:
        count += 1
        var = var2 = 0
    c = i
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split()))
x=[]
ans, count, q, xx = 0, 1, "<", 0
for i in range(n+1):
    if q=='<':
        if l[count]<=l[count-1]:
            count+=1
            continue
        else:
            if xx==0:
                q=">"
                xx+=1
                continue
            else:
                ans+=1
                q=">"
                continue
    if q=='>':
        if l[count]>=l[count-1]:
            count+=1
            continue
        else:
            ans+=1
            q="<"
            continue
print(ans+1)
Problem p02688 (python)

Fixed submission:
S = list(map(int,input().split()))
counter = 0
nuske = []

for k in range(S[0]):
  nuske.append(int(0))

for i in range(S[1]):
  roop = int(input())
  if roop == 1:
    temp = int(input())
    nuske[temp-1] = nuske[temp-1] + 1
  else:
    temp = list(map(int,input().split()))
    for l in temp:
      nuske[l-1] = nuske[l-1] + 1

for y in nuske:
  if y == 0:
    counter += 1
print(counter)

Buggy submission (verdict: Runtime Error):
S = list(map(int,input().split()))
counter = 0
nuske = []

for k in range(S[0]):
  nuske.append(int(0))

for i in range(S[1]):
  roop = int(input())
  for j in range(roop):
    if roop == 1:
      temp = int(input())
      nuske[temp-1] = nuske[temp-1] + 1
    else:
      temp = list(map(int,input().split()))
      for l in temp:
        nuske[l-1] = nuske[l-1] + 1

for y in nuske:
  if y == 0:
    counter += 1
print(counter)
Problem p02773 (python)

Fixed submission:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())

from collections import Counter
n = int(input())
s = Counter([input() for i in range(n)])
high = max(s.values())
ans = [k for k,v in s.items() if v==high]
print('\n'.join(sorted(ans)))

Buggy submission (verdict: Runtime Error):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())

import pandas as pd
n = int(input())
s = [input() for i in range(n)]
d = pd.Series(s).value_counts()
print('\n'.join(sorted(list(d[d==max(d)].index))))
Problem p02987 (python)

Fixed submission:
data=input()
if data[0]==data[1] and data[2]==data[3] and data[0]!=data[2]:
  print("Yes")
elif data[0]==data[2] and data[1]==data[3] and data[0]!=data[1]:
  print("Yes")
elif data[0]==data[3] and data[1]==data[2] and data[0]!=data[1]:
  print("Yes")
else:
  print("No")

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

count=0
for i in range(1,n-1):
  if int(data[i])>int(data[i-1]) and int(data[i])<=int(data[i+1]):
    count=+1
  elif int(data[i])<int(data[i-1]) and int(data[i])>=int(data[i+1]):
    count+=1

print(count)

Buggy submission (verdict: Runtime Error):
data=input().split()
if data[0]==data[1] and data[2]==data[3]:
  print("Yes")
elif data[0]==data[2] and data[1]==data[3]:
  print("Yes")
elif data[0]==data[3] and data[1]==data[2]:
  print("Yes")
else:
  print("No")
Problem p02989 (python)

Fixed submission:
n=int(input())
d_s=input().split()
d_i=[int(x) for x in d_s]
d=sorted(d_i)
k=d[int(n/2)]
t=d[int(n/2)-1]
print(k-t)

Buggy submission (verdict: Runtime Error):
n=int(input())
d_s=input().split()
d_i=[int(x) for x in d_s]
d=sorted(d_i)
k=d[n/2]
t=d[n/2-1]
print(k-t)
Problem p02659 (python)

Fixed submission:
A, B = map(float, input().split())

A = int(A)
B = round(100*B)

ans = int(int(A*B)//100)
print(ans)

Buggy submission (verdict: Runtime Error):
A, B = map(float, input().split())

A = int(a)
B = round(100*B)

ans = int(int(A*B)//100)
print(ans)
Problem p02711 (python)

Fixed submission:
N = input()

a = 0
for i in range(3):
  if N[i] == '7':
    a = 1
    
if a == 1:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
N = input()
 
a = 0
for i in range(3):
  if N[i] == '7':
    a = 1
    
if a = 1:
  print('Yes')
else:
  print('No')

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

a = 0
for i in range(3):
  if N[i] == 7:
    a = 1
    
if a = 1:
  print('Yes')
else:
  print('No')
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 = input()

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

Fixed submission:
N,D = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]

count = 0
for a in A:
  if a[0]**2 + a[1]**2 <= D**2:
     count += 1

print(count)

Buggy submission (verdict: Runtime Error):
N,D = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]

count = 0
for a in A:
  print(a[0]**2 + a[1]**2)
  if a[0]**2 + a[1]**2 <= D**2
     count += 1

print(count)
Problem p02624 (python)

Fixed submission:
n = int(input())
ans = 0
for i in range(1,n+1):
  k = n//i
  ans += i*(k*(k+1))//2
print(ans)

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

g = 0
for i in range(N):
    g += (i+1) * sympy.divisor_count(i+1)
print(g)
Problem p02627 (python)

Fixed submission:
val = input()
if val in 'abcdefghijklmnopqrstuvwxyz':
  ans = 'a'
else:
  ans = 'A'
  
print(ans)

Buggy submission (verdict: Runtime Error):
val = input()
if val in 'abcdefghijklmnopqrstuvwxyz':
  ans = a
else
  ans = A
  
print(ans)
Problem p02685 (python)

Fixed submission:
mod=998244353
fact=[1]
for i in range(1,2*10**5+1): #mod上での階乗を求める
 fact.append((fact[-1]*i)%mod)
revfact=[1]
for i in range(1,2*10**5+1): #mod上での階乗の逆元をフェルマーの小定理を用いて求める
 revfact.append(pow(fact[i],mod-2,mod))
n,m,k=map(int,input().split())
ans=0
for i in range(k,-1,-1): #各m(N-K<=m<=N)について場合の数を求める
 group=n-i
 tmp=fact[n-1]*revfact[group-1]*revfact[n-1-(group-1)]
 tmp%=mod
 tmp*=m
 tmp%=mod
 tmp*=pow(m-1,group-1,mod)
 ans+=tmp
 ans%=mod
print(ans)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 30 09:18:42 2020

@author: Aruto Hosaka
"""
from math import factorial

def comb(n,k,p):
  """power_funcを用いて(nCk) mod p を求める"""
  if n<0 or k<0 or n<k: return 0
  if n==0 or k==0: return 1
  a=factorial(n) %p
  b=factorial(k) %p
  c=factorial(n-k) %p
  return (a*power_func(b,p-2,p)*power_func(c,p-2,p))%p
def power_func(a,b,p):
  """a^b mod p を求める"""
  if b==0: return 1
  if b%2==0:
    d=power_func(a,b//2,p)
    return d*d %p
  if b%2==1:
    return (a*power_func(a,b-1,p ))%p


A = list(map(int, input().split()))
mod = 998244353
N = A[0]
M = A[1]
K = A[2]

s = (M*(M-1)**(N-1))
D = (M*(M-1)**(N-1))%mod
for k in range(1,K+1):
    s = s*(N-k)//k//(M-1)
    D += s%mod

print(D%mod)
Problem p02711 (python)

Fixed submission:
A = input()
for a in range(3):
  if A[a] == '7':
    print('Yes')
    break
  if a == 2:
    print('No')

Buggy submission (verdict: Runtime Error):
A = input()
for a in range(3):
  if A[a] == '7':
    print(yes)
    break
  if a == 2:
    print('No')
Problem p03075 (python)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if(e-a > k):
    print(':(')
else:
    print('Yay!')

Buggy submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
d = input()
e = input()
k = input()

if(e-a > k):
    print(':(')
else:
    print('Yay!')
Problem p02701 (python)

Fixed submission:
list1=[]
num=int(input())
for i in range (0,num):
    list1.append(input())
print(len(set(i for i in list1 if i.isalpha())))

Buggy submission (verdict: Runtime Error):
list1=[]
num=int(input())
for i in range (0,num):
	some=input()
    list1.append(some)
print(len(set(i for i in list1 if i.isalpha())))

Buggy submission (verdict: Runtime Error):
num=int(input())
for i in range (0,num):
	some=input()
    list1.append(some)
print(len(set(i for i in list1 if i.isalpha())))

Buggy submission (verdict: Runtime Error):
num=int(input())
for i in range (0,num):
	some=input(list1[])
    list1.append(some)
print(len(set(i for i in list1 if i.isalpha())))

Buggy submission (verdict: Runtime Error):
num=int(input())
for i in range (0,num):
	some=input(list1[])
    list1.append(some)
print(len(set(i for i in lst if i.isalpha())))
Problem p02793 (python)

Fixed submission:
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
  
N = int(input())
lst = list(map(int, input().split()))
const = 10**9 + 7

def solve(arr):
    ab = lcm(arr)
    sum = 0
    for a in arr:
        sum += ab // a
    return sum % const

answer = solve(lst)

print(int(answer))

Buggy submission (verdict: Runtime Error):
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
  
N = int(input())
lst = list(map(int, input().split()))
const = 10**9 + 7

L = lcm(lst)
answer = 0
for i in lst:
  answer += L / i
answer %= const

print(int(answer))

Buggy submission (verdict: Runtime Error):
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
  
N = int(input())
lst = list(map(int, input().split()))
const = 10**9 + 7

L = lcm(lst)
answer = 0
for i in lst:
  answer += L / i
answer %= const

print(answer)

Buggy submission (verdict: Runtime Error):
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
  
N = int(input())
lst = list(map(int, input().split()))
const = 10**9 + 7

L = lcm(lst)
answer = int(sum(map(lambda x: L/x % const, lst)) % const)

print(answer)

Buggy submission (verdict: Runtime Error):
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
  
N = int(input())
lst = list(map(int, input().split()))
const = 10**9 + 7

L = lcm(lst)
answer = sum(map(lambda x: L/x % const, lst)) % const

print(answer)

Buggy submission (verdict: Runtime Error):
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
  

N = int(input())
lst = list(map(int, input().split()))
lcm = lcm(lst)

a = 0
for i in range(N):
  a += int(lcm/lst[i])
print(a)

Buggy submission (verdict: Runtime Error):
import math
from functools import reduce

def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)
  
def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)
  
N = int(input())
lst = list(map(int, input().split()))
lcm = lcm_list(lst)

a = 0
for i in range(N):
  a += int(lcm/lst[i])
print(a)

Buggy submission (verdict: Runtime Error):
import math
from functools import reduce

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)
  
N = int(input())
lst = list(map(int, input().split()))
lcm = lcm_list(lst)

a = 0
for i in range(N):
  a += int(lcm/lst[i])
print(a)
Problem p02831 (python)

Fixed submission:
import fractions
a,b=map(int, input().split())
f=fractions.gcd(a,b)
f2=a*b//f
print(f2)

Buggy submission (verdict: Runtime Error):
import math

a, b = map(int, input().split())
def lcm(x, y):
    return (x * y) // math.gcd(x, y)

print(lcm(a, b))
Problem p02629 (python)

Fixed submission:
n=int(input())
k=n
keta=1
x=26
while k>x:
    k-=x
    keta+=1
    x*=26

book=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
l=[]

for i in reversed(range(1,keta)):
    s=(k-1)//(26**i)
    k-=s*(26**i)
    l.append(book[s])

l.append(book[k-1])
print("".join(l))

Buggy submission (verdict: Runtime Error):
n=int(input())
k=n
keta=1
x=26
while k>x:
    k-=x
    keta+=1
    x*=26

book=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
l=[]
for i in reversed(range(keta)):
    s=(k//(26**i))+1
    k-=(s-1)*(26**i)
    if i>0:
        l.append(book[s-1])
    else:
        l.append(book[s-2])
print("".join(l))
Problem p02712 (python)

Fixed submission:
n=int(input())
def t(k):
  return k*(k+1)//2
print(t(n)-3*(t(n//3))-5*(t(n//5))+15*(t(n//15)))

Buggy submission (verdict: Runtime Error):
n=int(input())
def t(n):
    if n < 1:
        return 0
    return n + t(n - 1)
print(t(n)-3*t(n//3)-5*t(n//5)+15*t(n//15))
Problem p02754 (python)

Fixed submission:
n,a,b=map(int,input().split())
x=n//(a+b)
if n-(a+b)*x<=a:
  t=n-x*(a+b)
else:
  t=a
print(a*x+t)

Buggy submission (verdict: Runtime Error):
x=n//(a+b)
if (a+b)*x<=a:
  t=n-x*(a+b)
else:
  t=a
print(a*x+t)
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=input()
print(round(n/2))
Problem p02773 (python)

Fixed submission:
import collections
n=int(input())
s=[]
for i in range(n):
  S=input()
  s.append(S)

c = collections.Counter(s)
l=c.most_common()
x=[l[0][0]]
for i in range(1,len(l)):
  if l[i-1][1]==l[i][1]:
    x.append(l[i][0])
  else:
    break
x.sort()    
for i in x:
  print(i)

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

c = collections.Counter(s)
l=c.most_common()
x=[l[0][0]]
for i in range(1,n):
  if l[i-1][1]==l[i][1]:
    x.append(l[i][0])
  else:
    break
x.sort()    
for i in x:
  print(i)

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

c = collections.Counter(s)
l=c.most_common()
print(l[0][0])
for i in range(1,n):
  if l[i-1][1]==l[i][1]:
    print(l[i][0])
  else:
    break

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

c = collections.Counter(s)
l=c.most_common()
print(l[0][0])
for i in range(1,n):
  if l[i-1][1]==l[i][1]:
    print(l[i][0])
  else:
    break

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

c = collections.Counter(s)
print(c.most_common()[0][0])
for i in range(1,n):
  if c.most_common()[i-1][1]==c.most_common()[i][1]:
    print(c.most_common()[i][0])
  else:
    break
Problem p02779 (python)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
x=0
a.sort()
for i in range(n-1):
  if a[i]==a[i+1]:
    x+=1
if x==0:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
x=0
a.sort()
for i in range(n-1):
  if a[i]==a[i+1]:
    x+=1
if x=0:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
x=0
a.sort()
for i in range(n-1):
  if a[i]=a[i+1]:
    x+=1
if x=0:
  print("YES")
else:
  print("NO")
Problem p02785 (python)

Fixed submission:
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
if k<=n:
  for i in range(k):
    h[i]=0
  print(sum(h))
else:
  print(0)

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
if k<=n:
  for i in range(k):
    a[i]=0
  print(sum(h))
else:
  print(0)
Problem p02819 (python)

Fixed submission:
import math
X=int(input())
while True:
    for i in range(2,int(math.sqrt(X))+1):
      if X%i==0:
        X+=1
        break
    else:
      print(X)
      break

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
cnt = 0
for i in range(n):
  if a[i] <= b[i]:
    cnt += a[i]
    b[i] -= a[i]
    if b[i] >= a[i+1]:
      cnt += a[i+1]
      a[i+1]=0
    else:
      cnt += b[i]
      a[i+1] -= b[i]
  else:
    cnt += b[i]
print(cnt)

Buggy submission (verdict: Runtime Error):
import math
X=int(input())
n=math.sqrt(X)
if X==2:
  print(X)
else:
  for i in range(2,n):
    if X%i==0:
      X+=1
  print(X)

Buggy submission (verdict: Runtime Error):

X=int(input())
if X==2:
  print(X)
else:
  for i in range(2,X**(1/2)):
    if X%i==0:
      X+=1
  print(X)

Buggy submission (verdict: Runtime Error):
from 
X=int(input())
if X==2:
  print(X)
else:
  for i in range(2,X**(1/2)):
    if X%i==0:
      X+=1
  print(X)

Buggy submission (verdict: Runtime Error):
X=int(input())
y=0
if X==2:
  print(X)
else:
  for i in range(2,X/2):
    if X%i==0:
      X+=1
  print(X)

Buggy submission (verdict: Runtime Error):
import math
X=int(input())
if X=2:
  print(X)
else:
  for i in range(math.sqrt(X)-1):
    if X%(2+i)==0:
      X+=1
    else:
      print(X)
Problem p02829 (python)

Fixed submission:
a=int(input())
b=int(input())
c=[1,2,3]
c.remove(a)
c.remove(b)
print(c[0])

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
l="123"
l.remove(a)
l.remove(b)
print(l)
Problem p02832 (python)

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

cnt = 0
num = 1

for i in range(n):
  if a[i] == num:
    num += 1
    cnt += 1

if cnt == 0:
  print(-1)
else:
  print(n - cnt)

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

cnt = 0
num = 1

for i in range(n):
  if a[i] == num:
    num += 1
    cnt += 1

if cnt == 0:
  pirnt(-1)
else:
  print(n - cnt)
Problem p02835 (python)

Fixed submission:
a1,a2,a3=map(int,input().split())
if a1+a2+a3>=22:
  print("bust")
else:
  print("win")

Buggy submission (verdict: Runtime Error):
a1,a2,a3=map(intinput().split())
if a1+a2+a3>=22:
  print("bust")
else:
  print("win")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int(input().split()))
if a+b+c>=22:
  print("bust")
else:
  print("win")

Buggy submission (verdict: Runtime Error):
a1,a2,a3=map(int(input().split()))
if a1+a2+a3>=22:
  print("bust")
else:
  print("win")
Problem p02836 (python)

Fixed submission:
S = input()
p=len(S)
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(int(t/2))

Buggy submission (verdict: Runtime Error):
S = list(map(int,input().split()))
p=len(S)
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(t/2)

Buggy submission (verdict: Runtime Error):
S = input()
len(S)=p
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(t/2)

Buggy submission (verdict: Runtime Error):
S = list(map(int,input().split()))
len(S)=p
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(t/2)

Buggy submission (verdict: Runtime Error):
S = list(map(int,input().split()))
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t/2)

Buggy submission (verdict: Runtime Error):
S = input()
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t/2)

Buggy submission (verdict: Runtime Error):
S = input()
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t)

Buggy submission (verdict: Runtime Error):
S = list(map(int,input().split()))
len(S)=int(p)
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t)

Buggy submission (verdict: Runtime Error):
S = list(map(int,input().split()))
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t)
Problem p02879 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=input(int,input().split())
if a<=9 and b<=9:
  print(str(a*b))
else:
  print(-1)

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

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

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

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

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

Buggy submission (verdict: Runtime Error):
a,b=input(int,inupt.split())
if a<10,b<10:
  print(a*b)
else:
  print("-1")
Problem p02880 (python)

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

Buggy submission (verdict: Runtime Error):
n=int(input())
for a in range(1,10):
  for b in  range(1,10):
    if n=a*b:
      print("Yes")
      exit()
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
for a in range(1,10):
  for b in range(1,10):
    if n==a*b:
    break
    print("Yes")
    else:
    print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
for a in range(1,10):
  for b in range(1,10):
  if n==a*b:
    break
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
for a in range(1,10):
  for b in range(1,10):
  if N==a*b:
    break
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
int(input()) = N
for a in range(1,10):
  for b in range(1,10):
  if N==a*b:
    break
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
int(input()) = N
for a in range(1,10):
  for b in range(a,10):
  if N==a*b:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
int(input()) = N
for a in range(1,10):
  for b in range(1,10):
  if N==a*b:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
input() = N
for i in range(10):
  if N==i**2:
    print("Yes")
  else:
    print("No")
Problem p02881 (python)

Fixed submission:
from math import sqrt

N = int(input())
for i in range(int(sqrt(N)), 0, -1):
    if N % i == 0:
        j = N // i
        print(i + j - 2)
        break

Buggy submission (verdict: Runtime Error):
from math import sqrt

N=int(input())
for i in range(int(sqrt(N)),0,-1):
    if N % i == 0:
        j=N//i
        pirnt(i+j-2)
        break

Buggy submission (verdict: Runtime Error):
from math import sqrt

N=int(input())
for i in range(int(sqrt(N)),0,-1):
  if N%i==0:
    j=N//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
from math import sqrt
n=int(input())
for i in range(int(sqrt(n)),0,-1):
  if n%i==0:
    j=n/i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
from math import sqrt
n=int(input())
for i in range(int(sqrt(n)),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
from math import sqrt
n=int(input())
for i in range(int(sqrt(n)),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
from math import sqrt
n=int(input())
for i in range(int(sqrt(n)),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
from math import sqrt
n=int(input())
for i in range(sqrt(n),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
from math import sqrt
n=input()
for i in range(sqrt(n),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
n=input()
for i in range(sqrt(n),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break

Buggy submission (verdict: Runtime Error):
n=inupt()
for i in range(sqrt(n),0,-1):
  if n%i==0:
    j=n//i
    pirnt(i+j-2)
    break
Problem p02915 (python)

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

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