Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import heapq

def check(h, T, A, B):
    # T回の爆破でいける？ -> BがT回行われる下で、残ったモンスターをT回のA - Bダメ攻撃で倒せる？
    que = []
    for hi in h:
        if hi - B * T > 0:
            que.append(- hi + B * T)
    que.sort()
    A_count = 0
    for q in que:
        count = (-q + (A - B) - 1) // (A - B)
        A_count += count
    
    return A_count <= T


N, A, B = map(int, input().split(" "))
h = []
for _ in range(N):
    h.append(int(input()))

lower, upper = 0, 10 ** 15

while upper - lower > 1:
    mid = (upper + lower) // 2
    if check(h, mid, A, B):
        upper = mid
    else:
        lower = mid

print(upper)

Fixed submission:
import heapq

def check(h, T, A, B):
    # T回の爆破でいける？ -> BがT回行われる下で、残ったモンスターをT回のA - Bダメ攻撃で倒せる？
    que = []
    for hi in h:
        if hi - B * T > 0:
            que.append(- hi + B * T)
    que.sort()
    A_count = 0
    for q in que:
        count = (-q + (A - B) - 1) // (A - B)
        A_count += count
    
    return A_count <= T


N, A, B = map(int, input().split(" "))
h = []
for _ in range(N):
    h.append(int(input()))

lower, upper = 0, 10 ** 15

while upper - lower > 1:
    mid = (upper + lower) // 2
    if check(h, mid, A, B):
        upper = mid
    else:
        lower = mid

print(upper)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

s = input().strip()
dp = tuple([{} for i in range(len(s))])

def f(i, g):
    if i == len(s):
        return 0
    if g in dp[i]:
        return dp[i][g]
    p = i - g
    ans = (-1 if s[i] == 'p' else 0) + f(i + 1, g + 1)
    if p + 1 <= g:
        ans = max(ans, (1 if s[i] == 'g' else 0) + f(i + 1, g))
    dp[i][g] = ans
    return ans


print(f(0, 0))

Fixed submission:
S = input()
N = len(S)
print(N // 2 - sum([int(s == 'p') for s in S]))

Buggy python submission (verdict: Time Limit Exceeded):
import sys
sys.setrecursionlimit(10 ** 7)

s = input().strip()
dp = {i:dict() for i in range(len(s))}
def f(i, g):
    if i == len(s):
        return 0
    if g in dp[i]:
        return dp[i][g]
    p = i - g
    ans = (-1 if s[i] == 'p' else 0) + f(i + 1, g + 1)
    if p + 1 <= g:
        ans = max(ans, (1 if s[i] == 'g' else 0) + f(i + 1, g))
    dp[i][g] = ans
    return ans


print(f(0, 0))

Fixed submission:
S = input()
N = len(S)
print(N // 2 - sum([int(s == 'p') for s in S]))

Buggy python submission (verdict: Runtime Error):
s = input()

dp = {i:dict() for i in range(len(s))}
def f(i, g):
    if i == len(s):
        return 0
    if g in dp[i]:
        return dp[i][g]
    p = i - g
    ans = (-1 if s[i] == 'p' else 0) + f(i + 1, g + 1)
    if p + 1 <= g:
        ans = max(ans, (1 if s[i] == 'g' else 0) + f(i + 1, g))
    dp[i][g] = ans
    return ans


print(f(0, 0))

Fixed submission:
S = input()
N = len(S)
print(N // 2 - sum([int(s == 'p') for s in S]))
Buggy python submission (verdict: Runtime Error):
import sys
import os
import math
f = open('test01.txt', 'r')
sys.stdin = f

n,x,t = map(int,input().split())
print(math.ceil(n/x)*t)

Fixed submission:
import math

n,x,t = map(int,input().split())
print(math.ceil(n/x)*t)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = list(map(int,input().split()))

sum = 0

for i in range(1,len(li)):
    if max(li[:i]) > li[i]:
        sum += max(li[:i]) - li[i]

print(sum)

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

sum = 0

for i in range(len(li)-1):
    if li[i] > li[i+1]:
        sum += li[i] - li[i+1]
        li[i+1] = li[i]

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

Fixed submission:
n = int(input())
if n == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a + b)
Buggy python submission (verdict: Runtime Error):
n,x,t=list(map(int,input().split()))
a=n%x
b=n//x

if a==0:
  c=b*t
else :
  c=(b+1)*t
print(C)



Fixed submission:
n,x,t=list(map(int,input().split()))
a=n%x
b=n//x
 
if a==0:
  c=b*t
else:
  c=(b+1)*t
print(c)

Buggy python submission (verdict: Runtime Error):
1=<N,X,T=<1000
number =N/X
number =round(number)
time = number*T
print(time)

Fixed submission:
n,x,t=list(map(int,input().split()))
a=n%x
b=n//x
 
if a==0:
  c=b*t
else:
  c=(b+1)*t
print(c)
Buggy python submission (verdict: Runtime Error):
n=(int.input())
if n%9==0:
  print(Yes)
else :
  print(No)
  

Fixed submission:
n=int(input())
if n%9==0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))

sum = 0
for n in range(N-1):
  if a[n]>a[n+1]:
    dif=a[n]-a[n+1]
    a[n+1]=a[n+1]+dif
    sum+=dif
print(sum)
		

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

sum = 0
for n in range(N-1):
	if a[n]>a[n+1]:
		dif=a[n]-a[n+1]
		a[n+1]=a[n+1]+dif
		sum=sum+dif
print(sum)

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

sum = 0
for n in range(N-1):
  if a[n]>a[n+1]:
    dif=a[n]-a[n+1]
	a[n+1]=a[n+1]+dif
	sum=sum+dif
print(sum)
		

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

sum = 0
for n in range(N-1):
	if a[n]>a[n+1]:
		dif=a[n]-a[n+1]
		a[n+1]=a[n+1]+dif
		sum=sum+dif
print(sum)

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

sum = 0
for n in range(N-1):
	if a[n]>a[n+1]:
		dif=a[n]-a[n+1]
		a[n+1]=a[n+1]+dif
		sum=sum+dif
print(sum)
		

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

sum = 0
for n in range(N-1):
	if a[n]>a[n+1]:
		dif=a[n]-a[n+1]
		a[n+1]=a[n+1]+dif
		sum=sum+dif
print(sum)
Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1,105):
	for j in range(1,105):
		for k in range(1,105):
			v = i*i+j*j+k*k+i*j+j*k+k*i;
			if v<10050:
				ans[v]+=1

for i in range(n):
	print(ans[i+1])

Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1,105):
	for j in range(1,105):
		for k in range(1,105):
			v = i*i+j*j+k*k+i*j+j*k+k*i;
			if v<10050:
				ans[v]+=1
                
for i in range(n):
	print(ans[i+1])

Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1,105):
    for j in range(1,105):
        for k in range(1,105):
            v=i*i+j*j+k*k+i*j+j*k+k*i;
            if v<10050:
            	ans[v]+=1
for i in range(n):
	print(ans[i+1])

Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = [0 for _in range(10050)]
for i in range(1,105):
    for j in range(1,105):
        for k in range(1,105):
            v=i*i+j*j+k*k+i*j+j*k+k*i;
            if v<10050:
            	ans[v]+=1
for i in range(n):
	print(ans[i+1])

Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = [0 for _ in range(10050)]
	for i in range(1,105):
    	for j in range(1,105):
        	for k in range(1,105):
            	v=i*i+j*j+k*k+i*j+j*k+k*i;
              	if v<10050:
                  ans[v]+=1
 
for i in range(n):
	print(ans[i+1])

Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Buggy python submission (verdict: Runtime Error):
l,r,d=map(int.input().split())
print(r//d-(l-1)//d)


Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Buggy python submission (verdict: Runtime Error):
map(int,input().spilit())
print(r//d-(l-1)//d)


Fixed submission:
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)
Buggy python submission (verdict: Runtime Error):
n=int(input())
ans = [0 for _in range(10050)]
	for i in range(1,105):
    	for j in range(1,105):
        	for k in range(1,105):
            	v=i*i+j*j+k*k+i*j+j*k+k*i;
              	if v<10050:
                  ans[v]+=1

for i in range(n):
  print(ans[i+1])
  

Fixed submission:
n=int(input())
ans = [0 for _ in range(10050)]
for i in range(1,105):
	for j in range(1,105):
		for k in range(1,105):
			v = i*i+j*j+k*k+i*j+j*k+k*i;
			if v<10050:
				ans[v]+=1

for i in range(n):
	print(ans[i+1])
Buggy python submission (verdict: Runtime Error):
N=int(input())
x0,x1,x2,x3=0,0,0,0
 
for i in range(N)
	Si=input()
  	if Si=='AC':
      x0=x0+1
    
    elif Si=='WA':
      x1=x1+1
    
    elif Si=='TLE':
      x2=x2+1
    
    else Si=='RE':
      x3=x3+1
 
print('AC x' str(x0))
print('WA x' str(x1))
print('TLE x' str(x2))
print('RE x' str(x3))

Fixed submission:
N = int(input())
C0, C1, C2, C3 = 0, 0, 0, 0
for i in range(N):
    Si = input()
    if Si == 'AC':
        C0 += 1
 
    elif Si == 'WA':
        C1  += 1
 
    elif Si == 'TLE':
        C2 += 1
 
    else:
        C3 += 1
 
print('AC x ' + str(C0))
print('WA x ' + str(C1))
print('TLE x ' + str(C2))
print('RE x ' + str(C3))

Buggy python submission (verdict: Runtime Error):
N=int(input())
x0,x1,x2,x3=0,0,0,0

for i in range(N)
	Si=input()
  	if Si=='AC':
      x0=x0+1
    
    if Si=='WA':
      x1=x1+1
    
    if Si=='TLE':
      x2=x2+1
    
    if Si=='RE':
      x3=x3+1

print('AC x' str(x0)
print('WA x' str(x1)
print('TLE x' str(x2)
print('RE x' str(x3))

Fixed submission:
N = int(input())
C0, C1, C2, C3 = 0, 0, 0, 0
for i in range(N):
    Si = input()
    if Si == 'AC':
        C0 += 1
 
    elif Si == 'WA':
        C1  += 1
 
    elif Si == 'TLE':
        C2 += 1
 
    else:
        C3 += 1
 
print('AC x ' + str(C0))
print('WA x ' + str(C1))
print('TLE x ' + str(C2))
print('RE x ' + str(C3))
Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
differnce=0
for i in range(len(S)):
  if S[i]!=T[i]:
    difference+=1
print(difference)

Fixed submission:
S=input()
T=input()
difference=0
for i in range(len(S)):
  if S[i]!=T[i]:
    difference+=1
print(difference)

Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
differnce=0
for i in range(len(S)):
  if S[i]!=T[i]:
      difference+=1
print(difference)

Fixed submission:
S=input()
T=input()
difference=0
for i in range(len(S)):
  if S[i]!=T[i]:
    difference+=1
print(difference)

Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
 
differnce=0
 
for i in range(len(S)):
  if S[i]!=T[i]
      difference +=1
 
print(difference)
 

Fixed submission:
S=input()
T=input()
difference=0
for i in range(len(S)):
  if S[i]!=T[i]:
    difference+=1
print(difference)

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

differnce=0

for i in range(len(S)):
  if [S[i]!=T[i])
      difference +=1

print(difference)




Fixed submission:
S=input()
T=input()
difference=0
for i in range(len(S)):
  if S[i]!=T[i]:
    difference+=1
print(difference)
Buggy python submission (verdict: Runtime Error):
n = int(input())
arr = list(map(int, input().split()))
if 0 in arr:
    print(0 + '\n')
else:
    mul = 1
    for n in arr:
        mul *= n
        if mul > 10**18:
            print(-1 + '\n')
            break
    else:
        print(mul + '\n')

Fixed submission:
n = int(input())
arr = list(map(int, input().split()))
if 0 in arr:
    print('0' + '\n')
else:
    mul = 1
    for n in arr:
        mul *= n
        if mul > 10**18:
            print('-1' + '\n')
            break
    else:
        print(str(mul) + '\n')
Buggy python submission (verdict: Runtime Error):
A,B = list(map(int,inpuut().split()))
print(A*B)

Fixed submission:
A,B = list(map(int,input().split()))
print(A*B)
Buggy python submission (verdict: Runtime Error):
N = int(input())
li = []
C = 1
while C <= 10**18:
	for i in range(N):
		li.insert(i,int(input())
    	C *= li[i]
if C <= 10**18:
	print(C)
else: print(-1)

    
	
            
  

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
L.sort()
c = 1
for i in range(N):
    c *= L[i]
    if c > 10**18:
        c = -1
        break
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
li = list(map(int,input().split()))
C = 1
for i in range(N):
  C *= li[i]
if C <= 10 ** 18:
  print(C)
else: print(-1)

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
L.sort()
c = 1
for i in range(N):
    c *= L[i]
    if c > 10**18:
        c = -1
        break
print(c)

Buggy python submission (verdict: Runtime Error):
N = int(input())
li = list(map(int,input()))
C = 1
for i in range(N):
  C *= li[i]
if C <= 10 ** 18:
  print(C)
else: print(-1)

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
L.sort()
c = 1
for i in range(N):
    c *= L[i]
    if c > 10**18:
        c = -1
        break
print(c)
Buggy python submission (verdict: Runtime Error):
import math
A,B = list(map(float,input().split()))
A = int(A)
print(math.floor(A*(B*100)/100))s

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))

Buggy python submission (verdict: Runtime Error):
import math
A = int(input().rstrip()) 
B = float(input())
print(math.floor(A*(B*100)/100))

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))

Buggy python submission (verdict: Runtime Error):
import Math
A = int(input()) 
B = float(input())
print(Math.floor(A*(B*100)/100))

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))

Buggy python submission (verdict: Runtime Error):
import Math
A,B = list(map(float,input().split()))
print(Math.floor(A*(B*100)/100))

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))

Buggy python submission (verdict: Runtime Error):
import math
A,B = list(map(float,input().split()))
print(math.floor((A*(B*100))/100)

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))

Buggy python submission (verdict: Runtime Error):
A,B = list(map(float,input().split()))
print(A*(B*100))/100

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))

Buggy python submission (verdict: Runtime Error):
A,B = list(map(int,input().split()))
print(A*(B*100)/100)

Fixed submission:
import decimal
import math
A,B = input().split()
A = int(A)
B = decimal.Decimal(B)
print(math.floor(A*B))
Buggy python submission (verdict: Time Limit Exceeded):
A,B,C,D = list(map(int,input().split()))
while A > 0 or B > 0:
  A -= D
  C -= B
if A <= 0:
  print('No')
elif B <= 0:
        print('Yes')
  
  

Fixed submission:
A,B,C,D = list(map(int,input().split()))
a=0
c=0
while A > 0:
  A -= D
  a += 1#何回でやられたか
while C > 0:
  C -= B
  c += 1#何回で倒したか
if a < c:
  print('No')
elif a >= c:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = [9,8,7,6,5,4,3,2,1]
if 0 < n and n <= 81:
    for i in range(9):
        if n % a[i] == 0:
            if n / a[i] > 9:
                print('No')
            else:
                print('Yes')
                break
else:
    print('No')


Fixed submission:
n = int(input())
D = 0
for i in range(1,10):
  for j in range(1,10):
    if j*i == n:
      D = 1
      break
if D == 1:
  print('Yes')
elif D == 0:
  print('No')
Buggy python submission (verdict: Runtime Error):
N,X,T= map(int, input().split())
if N%X==0:
  print((N/X)*T)
else:
  print(N/X +1)*T)

Fixed submission:
N,X,T= map(int, input().split())
if N%X==0:
  print((N//X)*T)
else:
  print(((N//X)+1)*T)

Buggy python submission (verdict: Runtime Error):
N,X,T=int(input())
if  N%X==0:
  print((N/X)*T)
else:
  print((N/X +1)*T)

Fixed submission:
N,X,T= map(int, input().split())
if N%X==0:
  print((N//X)*T)
else:
  print(((N//X)+1)*T)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A = list(map(int, input().split()))
i = 0
sum = 0
while i<N:
  if A[i]<=A[i+1]:
    f=0
  else:
    f=A[i]-A[i+1]
  A[i+1]+=f
  sum+=f
  i+=1
print(sum)

Fixed submission:
N=int(input())
A = list(map(int, input().split()))
i = 0
sum = 0
while i<N-1:
  if A[i]<=A[i+1]:
    f=0
  else:
    f=A[i]-A[i+1]
  A[i+1]+=f
  sum+=f
  i+=1
print(sum)
Buggy python submission (verdict: Runtime Error):
x, k ,d = map(int, input().split())
a=[0]*(k+1)
a[0] = x
for i in range(1,k+1):
    a[i] = min(abs(a[i-1]-d), abs(a[i-1]+d))
print(a[k])

Fixed submission:
x, k ,d = map(int, input().split())
x=abs(x)
if k*d <= x:
    print(x-k*d)
else:
    xx = x
    x -= min(k, x//d)*d
    k -= min(k, xx//d)
    if k % 2 != 0:
        ans = min(abs(x-d),abs(x+d))
    else:
        ans = min(abs(x), abs(x-2*d))
    print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
arr=[]
arr=list(map(int,input().split()))
mul=1
for i in range(n):
  mul*=arr[i]
  if(mul>1000000000000000000):
    print("-1")
    return
print(mul)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
a.sort()
ans=1
for i in a:
    ans*=i
    if ans>10**18:
        ans=-1
        break
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s == 0
for i in n:
  s += i
if s % 9 == 0:
  print("Yes")
else:
  print("No")
  

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

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = 0
for i in n:
  s += n[i]
if s % 9 == 0:
  print("Yes")
else:
  print("No")
  

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

Buggy python submission (verdict: Runtime Error):
n = int(input())
s == 0
for i in n:
  s += n[i]
if s % 9 == 0:
  print("Yes")
else:
  print("No")
  

Fixed submission:
s = input()
sum = 0
for i in s:
  sum+=int(i)
if sum%9==0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = map(int,input().split())
if len(l) < 3:
  print(0)
  exit()
count = 0
l = sorted(l)
for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if l[i] != l[j] != l[k] and l[i]+l[j] > l[k]:
        count += 1
print(count)
    

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
if len(l) < 3:
  print(0)
  exit()
count = 0
l = sorted(l)
for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if l[i] != l[j] != l[k] and l[i]+l[j] > l[k]:
        count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n = int(input())
l = map(int,input().split())
count = 0
if len(l) < 3:
  print(0)
  exit()
l = sorted(l)
for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if l[i] != l[j] != l[k] and l[i]+l[j] > l[k]:
        count += 1
print(count)
    

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
if len(l) < 3:
  print(0)
  exit()
count = 0
l = sorted(l)
for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if l[i] != l[j] != l[k] and l[i]+l[j] > l[k]:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a = input()
l = a.split("")
b = l.index("0")
print(b+1)

Fixed submission:
a=input()
l=a.split(" ")
b=l.index("0")
print(b+1)
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
if 2*x <= y <= 4x and y %2 =0:
  print("Yes")
else:
  print("No")

Fixed submission:
x,y = map(int,input().split())
if 2*x <= y <= 4*x and y %2 == 0:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
if 2*x <= y <= 4x and y %2 =0:
  print("Yes")
else:
  print("No")

Fixed submission:
x,y = map(int,input().split())
if 2*x <= y <= 4*x and y %2 == 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
S = str(input())
if S = "ABC":
  print("ARC")
else:
  print("ABC")

Fixed submission:
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")
Buggy python submission (verdict: Runtime Error):
S = int(input())
W = int(input())
if W >= S:
  print("unsafe")
else:
  print("safe")

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

Buggy python submission (verdict: Runtime Error):
S = int(input())
W = int(input())
if S > W:
  print("safe")
else:
  print("unsafe")

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

Buggy python submission (verdict: Runtime Error):
S = int(input())
W = int(input())
if S > W:
  print("safe")
else:
  print("unsafe")

Fixed submission:
s, w = map(int, input().split())
 
if s <= w:
  print('unsafe')
else:
  print('safe')
Buggy python submission (verdict: Runtime Error):
R = input()
print(2*3.14*R)

Fixed submission:
R = int(input())
print(2*3.14*R)
Buggy python submission (verdict: Runtime Error):
N = int(input())
l = len(N)
for i in range(l):
  if N[i] ==7:
    print("Yes")
    exit()
print("No")    

Fixed submission:
N = input()
l = len(N)
for i in range(l):
  if N[i] =="7":
    print("Yes")
    exit()
print("No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
l = len(N)
for i in range(l):
  if N.index(i) ==7:
    print("Yes")
    exit()
print("No")    

Fixed submission:
N = input()
l = len(N)
for i in range(l):
  if N[i] =="7":
    print("Yes")
    exit()
print("No")
Buggy python submission (verdict: Runtime Error):
S = list(input())
if S[0］== S[1] == S[2]:
     print("No")
else:
     print("Yes")

Fixed submission:
s = list(input())
if s[0] == s[1] == s[2]:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
h,a = map(int,input().split())
if h % a = 0:
  print(h//a)
else:
  print(h//a+1)


Fixed submission:
h,a = map(int,input().split())
if h % a == 0:
  print(h//a)
else:
  print(h//a+1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
p = map(int,input().split())

ans = 0

for i in range(1,n-1):
  if p[i-1]<p[i]<p[i+1] or p[i+1]<p[i]<p[i-1]:
    ans += 1
    
print(ans)
    

Fixed submission:
n = int(input())
p = list(map(int,input().split()))
 
ans = 0
 
for i in range(1,n-1):
  if p[i-1]<p[i]<p[i+1] or p[i+1]<p[i]<p[i-1]:
    ans += 1
    
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
N = input()

sum = 0
if int(N) != 0:
    data_size = int(math.log10(int(N)) + 1)
    for data_size in range(data_size):
        sum += int(N[data_size])

else:
    sum = 0
    
if sum%9 == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
N = input()

sum = 0
if int(N) != 0:
    data_size = len(N)
    for data_size in range(data_size):
        sum += int(N[data_size])

else:
    sum = 0

if sum%9 == 0:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import math
N = input()

sum = 0
data_size = int(math.log10(int(N)) + 1)
for data_size in range(data_size):
    sum += int(N[data_size])

if sum%9 == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
N = input()

sum = 0
if int(N) != 0:
    data_size = len(N)
    for data_size in range(data_size):
        sum += int(N[data_size])

else:
    sum = 0

if sum%9 == 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import sys

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


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

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

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