Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = input()
A = [x for x in input().split()]
five = False
three = False
for x in range(A):
  if(x%5==0):
    five = True
  elif(x%3==0):
    three = True
    
if(five.equals(True) and three.equals(True)):
   print("APPROVED)
else:
   print("DENIED")
  


Fixed submission:
N = input()
_list = input().split(" ")
_list = [int(x) for x in _list]
even = [x for x in _list if x % 2==0]
answer = []
for x in even:
    if x % 3 == 0 or x % 5 == 0:
        answer.append(True)
if len(even) == len(answer):
    print("APPROVED")
else:
    print("DENIED")

Buggy python submission (verdict: Runtime Error):
N = input()
A = [x for x in input().split()]
five = False
three = False
for x in range(A):
  if(x%5==0):
    five = True
  elif(x%3==0):
    three = True
    
if(five.equals(True) and three.equals(True):
   print("APPROVED)
else:
   print("DENIED")
  


Fixed submission:
N = input()
_list = input().split(" ")
_list = [int(x) for x in _list]
even = [x for x in _list if x % 2==0]
answer = []
for x in even:
    if x % 3 == 0 or x % 5 == 0:
        answer.append(True)
if len(even) == len(answer):
    print("APPROVED")
else:
    print("DENIED")
Buggy python submission (verdict: Runtime Error):
import math
H, A= [int(i) for i in input().split()]
print(math.ceil(H,A))

Fixed submission:
a,b = map(int,input().split())
print(a//b if a%b ==0 else a//b+1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
sum = 0
b = [i % (10**9+7) for i in a if i % (10**9+7) != 0]
# print(b)
for j in range(0,len(b)-1):
    for k in range(j+1,len(b)):
        c = b[j]*b[k]
        sum = sum + c
print(sum%(10**9+7))

Fixed submission:
d, t, s = map(int, input().split())
if t*s < d:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
sum = 0
for i in range(0,n-1):
    for j in range(i+1,n):
        b = a[i]*a[j]%(10**9+7)
        sum = sum + b
print(sum%(10**9+7))

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

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
sum = 0
b = [i % (10**9+7) for i in a if i % (10**9+7) != 0]
# print(b)
for j in range(0,len(b)-1):
    for k in range(j+1,len(b)):
        c = b[j]*b[k]
        sum = sum + c
print(sum%(10**9+7))

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

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
sum = 0
for i in range(0,n-1):
    for j in range(i+1,n):
        b = a[i]*a[j]
        sum = sum + b
print(sum%(10**9+7))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
A = sum(a)
s = 0
for i in range(n-1):
    A = A - a[i]
    b = (a[i]*A)%(10**9+7)
    s = s + b
print(s%(10**9+7))
Buggy python submission (verdict: Runtime Error):
x, k, d = map(int, input().split())
if (x - k*d > 0 and x > 0) or (x + k*d < 0 and x < 0):
    print(abs(x) - k*d )
else:
    if x % d == 0:
        if ((x/d) % 2) == (k % 2):
            print(0)
        else:
            print(d)
    else:
        y = abs(x)
        if (y % d < d - (y % d) and ((y - (y % d)) / d) % 2 == k % 2) or (y % d > d - (y % d) and ((y - (y % d)) / d) % 2 != k % 2):
            print(y % d)
        else:
            print(d - (y % d))
            

Fixed submission:
t = input()
if (abs(len(t))<=3) and (t in 'S' or 'R'):
    if t[0]=='R' and t[1]=='R' and t[2]=='R':
        print(3)
    elif (t[0]=='R' and t[1]=='R' and t[2]!='R') or (t[0]!='R' and t[1]=='R' and t[2]=='R'):
        print(2)
    elif t[0]!='R' and t[1]!='R' and t[2]!='R':
        print(0)
    else:
        print(1)
else:
    print('false')
Buggy python submission (verdict: Runtime Error):
a, b, c, k = map(int, input().split())
A = [1]*a
B = [0]*b
C = [-1]*c
K = A+B+C
print(sum(K[0:k]))

Fixed submission:
a, b, c, k = map(int, input().split())
if k <= a:
    print(k)
elif a < k <= a+b:
    print(a)
elif a+b <= k:
    print(a-(k-a-b))
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,d,e,f = map(int, input().split())
con = list()
s = list()
for x in range(31):
    for y in range(31):
        for v in range(1501):
            if x == y == 0:
                continue
            else:
                w1 = (f-(100*a*x + 100*b*y + c*v))//d
#                 w2 = (100*a*x + 100*b*y -c*v)//d
                w3 = ((100*a*x + 100*b*y)*e -c*v*100)//(100*d)
                w = min(w1,w3)
                con1 = 100*(c*v + d*w)/(100*a*x + 100*b*y +c*v +d*w)
                con.append(con1)
                s.append([x,y,v,w])
conm = max(con)
conin =con.index(conm)
t = s[conin]
# print(t)
ans1 = 100*a*t[0] + 100*b*t[1] + c*t[2] + d*t[3]
ans2 = c*t[2] + d*t[3]
print(ans1,ans2)


Fixed submission:
a,b,c,d,e,f = map(int, input().split())
s = [0,0,0,0]
con1 = 0
for x in range(31):
    for y in range(31):
        for v in range(1501):
            if x == y == 0:
                continue
            else:
                w1 = (f-(100*a*x + 100*b*y + c*v))//d
                w2 = (100*a*x + 100*b*y -c*v)//d
                w3 = ((100*a*x + 100*b*y)*e -c*v*100)//(100*d)
                w = min(w1,w2,w3)
                con2 = 100*(c*v + d*w)/(100*a*x + 100*b*y +c*v +d*w)
                if con1 <= con2 and w >= 0:
                    con1 = con2
                    s = [x,y,v,w]
                else:
                    continue

ans1 = 100*a*s[0] + 100*b*s[1] + c*s[2] + d*s[3]
ans2 = c*s[2] + d*s[3]
print(ans1,ans2)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,d,e,f = map(int, input().split())
con = list()
s = list()
for x in range(31):
    for y in range(31):
        for v in range(1501):
            if x == y == 0:
                continue
            else:
                w1 = (f-(100*a*x + 100*b*y + c*v))//d
                w2 = (100*a*x + 100*b*y -c*v)//d
                w3 = ((100*a*x + 100*b*y)*e -c*v*100)//(100*d)
                w = min(w1,w2,w3)
                con1 = 100*(c*v + d*w)/(100*a*x + 100*b*y +c*v +d*w)
                con.append(con1)
                s.append([x,y,v,w])
conm = max(con)
conin =con.index(conm)
t = s[conin]
# print(t)
ans1 = 100*a*t[0] + 100*b*t[1] + c*t[2] + d*t[3]
ans2 = c*t[2] + d*t[3]
print(ans1,ans2)


Fixed submission:
a,b,c,d,e,f = map(int, input().split())
s = [0,0,0,0]
con1 = 0
for x in range(31):
    for y in range(31):
        for v in range(1501):
            if x == y == 0:
                continue
            else:
                w1 = (f-(100*a*x + 100*b*y + c*v))//d
                w2 = (100*a*x + 100*b*y -c*v)//d
                w3 = ((100*a*x + 100*b*y)*e -c*v*100)//(100*d)
                w = min(w1,w2,w3)
                con2 = 100*(c*v + d*w)/(100*a*x + 100*b*y +c*v +d*w)
                if con1 <= con2 and w >= 0:
                    con1 = con2
                    s = [x,y,v,w]
                else:
                    continue

ans1 = 100*a*s[0] + 100*b*s[1] + c*s[2] + d*s[3]
ans2 = c*s[2] + d*s[3]
print(ans1,ans2)
Buggy python submission (verdict: Time Limit Exceeded):
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
    for y in range(x,k+1):
        for z in range(y,k+1):
            if x+y+z == s:
                if x != y != z :
                    ans += 6
                elif x == y != z or x != y == z:
                    ans += 3
                elif x == y == z:
                    ans += 1
print(ans)

Fixed submission:
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
    for y in range(k+1):
            if 0 <= s-x-y <= k: 
                ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if x+y+z == s:
                ans += 1
print(ans)

Fixed submission:
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
    for y in range(k+1):
            if 0 <= s-x-y <= k: 
                ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = list(map(int, input().split()))
ans = []
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if x+y+z == s:
                ans.append([x,y,z])
print(len(ans))

Fixed submission:
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
    for y in range(k+1):
            if 0 <= s-x-y <= k: 
                ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
B = [0]*N

for i in range(N):
  A[i] = int(A[i])
  B[i] = A[i]*A[i]

print( ( ( (sum(A)*sum(A)) - sum(B) ) // 2 ) % ( 10**9 + 7 ) // 2 )


Fixed submission:
D, T, S = map(int,input().split())
if (D <= (T*S)):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
if (int(input())%9 == 0:
  print("Yes")
else:
  print("No")


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

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


Fixed submission:
N, X, T = map(int,input().split())
if N % X == 0:
  print( T*N // X )
else:
  print( T*(N // X + 1))
Buggy python submission (verdict: Runtime Error):
if (int(input())%9 == 0:
    print("Yes")
else:
    print("No")

Fixed submission:
if int(input()) % 9 == 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
count = 0
for i in range(N-1):
  if A[i] > A[i+1]:
    count += A[i+1] - A[i]
    A[i+1] = A[i]

print(count)

Fixed submission:
N = int(input())
A = input().split()
count = 0
for i in range(N-1):
  if int(A[i]) > int(A[i+1]):
    count += int(A[i]) - int(A[i+1])
    A[i+1] = int(A[i])

print(count)
Buggy python submission (verdict: Runtime Error):
X,N = map(int,input().split())
p = input().split()

for i in range(N):
    p[i] = int(p[i])
    
if N == 0:
    print(X)
else:    
    for i in range(1,N+1):
        if not (X+i) in p:
            print(X+i)
            break
        elif not (X-i) in p:
            print(x-i)

Fixed submission:
X,N = map(int,input().split())
if N != 0:
  p = input().split()

for i in range(N):
    p[i] = int(p[i])
    
if N == 0:
    print(X)
else:    
    for i in range(2*N):
        if not (X-i) in p:
            print(X-i)
            break
        elif not (X+i) in p:
            print(X+i)
            break
        else:
          continue
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
answer = 1
flag = 0
x = 10**18

if '0' in A:
  print(0)
  flag = 1
  
for i in range(N):
  answer *= int(A[i])
  if answer > x:
    print(-1)
    flag = 1
    break

if flag == 0:
  print(answer)



Fixed submission:
A,B =map(int,input().split())
print(A*B)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
answer = 1
flag = 0
x = 10**18
for i in range(N):
  A[i] = int(A[i])
  answer *= A[i]
  if answer == 0:
    break

check = answer/x
if ((check) >= 1) and (answer != x):
  print(-1)
else:
  print(answer)

Fixed submission:
A,B =map(int,input().split())
print(A*B)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
answer = 1
flag = 0
x = 10**18
for i in range(N):
  A[i] = int(A[i])
  answer *= A[i]
  if answer == 0:
    break

check = answer/x
if ((check) >= 1) and (answer != x):
  print(-1)
else:
  print(answer)

Fixed submission:
N = int(input())
A = input().split()
answer = 1
flag = 0
x = 10**18

if '0' in A:
  print(0)
  flag = 1
  


if flag == 0:
  for i in range(N):
    answer *= int(A[i])
    if answer > x:
      print(-1)
      flag = 1
      break

if flag == 0:    
  print(answer)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
answer = 1
flag = 0
x = 10**18
for i in range(N):
  answer *= int(A[i])

check = answer/x
if ((check) >= 1) and (answer != x):
  print(-1)
else:
  print(answer)



Fixed submission:
N = int(input())
A = input().split()
answer = 1
flag = 0
x = 10**18

if '0' in A:
  print(0)
  flag = 1
  


if flag == 0:
  for i in range(N):
    answer *= int(A[i])
    if answer > x:
      print(-1)
      flag = 1
      break

if flag == 0:    
  print(answer)
Buggy python submission (verdict: Runtime Error):
A,B = map(float,input().split())
print(int(A*B)

Fixed submission:
A,B = input().split()
a = int(A)
b1 = int(B[0])*100
b2 = int(B[2])*10
b3 = int(B[3])

answer = a*(b1+b2+b3) // 100
print(answer)
Buggy python submission (verdict: Runtime Error):
S = input()
length =len(S)
count = 0

for i in range(len):
  if S[i] = '?':
    S[i] = D

print(S)

Fixed submission:
S = input()
length =len(S)
S = list(S)
count = 0

for i in range(length):
  if S[i] == '?':
    S[i] = 'D'

answer = "".join(S)
print(answer)
Buggy python submission (verdict: Runtime Error):
import math
print(math.sqrt( {0}*{0} + {1}*{1} - 2*{0}*{1}*math.cos(math.radians(abs(( {2} * 30 - 11/2 * {3})))).format(map(int, input().split()))

Fixed submission:
import math
A,B,H,M = map(int,input().split())
rad = abs(( H + M/60 ) * 30 - 6 * M)
rad = math.radians(rad)
cos = math.cos(rad)
answer = math.sqrt( A*A + B*B - 2*A*B*cos)
print(answer)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
if (S in T) and (S[0] == T[0])
  if ((len(S) > 1) and (S[1] == T[1])) or (len(S) == 1):
    print('Yes')
else:
  print('No')
  


Fixed submission:
S = input()
T = input()
if (S in T) and (S[0] == T[0]):
  if ((len(S) > 1) and (S[1] == T[1])) or (len(S) == 1):
    print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
if (S in T) and (S[0] == T[0])
  if ((len(S) > 1) and (S[1] == T[1])) or (len(S) = 1):
    print('Yes')
else:
  print('No')
  


Fixed submission:
S = input()
T = input()
if (S in T) and (S[0] == T[0]):
  if ((len(S) > 1) and (S[1] == T[1])) or (len(S) == 1):
    print('Yes')
else:
  print('No')

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


Fixed submission:
S = input()
T = input()
if (S in T) and (S[0] == T[0]):
  if ((len(S) > 1) and (S[1] == T[1])) or (len(S) == 1):
    print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
H = input().split()
good = [1]*N
import collections

for i in range(M):
  a,b = map(int,input().split())
  if int(H[a-1]) >= int(H[b-1]):
    good[int(H[b-1])] = 0
  else:
    good[int(H[a-1])] = 0  
    
c = collections.Counter(good)
print(c[1])

Fixed submission:
N,M = map(int,input().split())
H = input().split()
good = [1]*N
import collections

for i in range(M):
  a,b = map(int,input().split())
  if int(H[a-1]) > int(H[b-1]):
    good[b-1] = 0
  elif int(H[a-1]) < int(H[b-1]):
    good[a-1] = 0
  else:
    good[a-1] = 0
    good[b-1] = 0
    
c = collections.Counter(good)
print(c[1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = []
count = 0
for i in range(N):
  S.append(input())

for i in range(0,N):
  if S[i] != '0':
    count += 1
    for j in range(i+1,N):
      if (S[j] != '0'):
        if S[i] == S[j]:
          S[j] = '0'
         
print (count)  

Fixed submission:
S,W = map (int,input().split())
if S > W:
  print("safe")
else :
  print("unsafe")

Buggy python submission (verdict: Runtime Error):
S,W = map (int12,input().split())
if S > W:
  print("safe")
else :
  print("unsafe")


Fixed submission:
S,W = map (int,input().split())
if S > W:
  print("safe")
else :
  print("unsafe")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = []
count = 0
for i in range(N):
  S.append(input())
  if S[i] != '0':
    count += 1
    for j in range(i+1,N):
      if (S[j] != '0'):
        if S[i] == S[j]:
          S[j] = '0'
         
print (count)  


Fixed submission:
import collections

N = int(input())
S = []
count = 0
for i in range(N):
  S.append(input())

count = len(collections.Counter(S))
         
print (count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
count = 0
for i in range(N):
  S.append(input())

for i in range(0,N):
  if S[i] != '0':
    count += 1
    for j in range(i+1,N):
      if (S[j] != '0'):
        if S[i] == S[j]:
          S[j] = '0'
         
print (count)  

Fixed submission:
import collections

N = int(input())
S = []
count = 0
for i in range(N):
  S.append(input())

count = len(collections.Counter(S))
         
print (count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()

for i in range(1,N+1):
    print(A.count(str(i)))


Fixed submission:
R = input()

print( 2 * 3.141 * int(R) )

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
rank = []

for i in range(1,N+1):
    print(A.count(i))


Fixed submission:
R = input()

print( 2 * 3.141 * int(R) )

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
rank = []

for i in range(1,N+1):
    rank.append(A.count(i))
    


for i in range(0,N+1):
    print(rank[i])
    


Fixed submission:
R = input()

print( 2 * 3.141 * int(R) )

Buggy python submission (verdict: Runtime Error):
N,M = input().split()
A = input().split()
 
S = 0
for i in range(int(M)):
    S += int(A[ i - 1 ])

if int(N) - S >= 0:
    print(int(N) - S)
else:
    print("-1")

Fixed submission:
R = input()

print( 2 * 3.141 * int(R) )

Buggy python submission (verdict: Runtime Error):
R = int (input())

print( 2 * pi * R )

Fixed submission:
R = input()

print( 2 * 3.141 * int(R) )

Buggy python submission (verdict: Runtime Error):
R = int (input())

print( 2 * pi * R )

Fixed submission:
R = input()

print( 2 * 3.141 * int(R) )
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
c = collections.Counter(A)

import collections
for i in range(1,N+1):
    print(c[str(i)])


Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()

for i in range(1,N+1):
    print(A.count(str(i)))

Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()

for i in range(1,N+1):
    print(A.count(str(i)))


Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()

for i in range(1,N+1):
    print(A.count(str(i)))


Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()

for i in range(1,N+1):
    print(A.count(str(i)))


Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()

for i in range(1,N+1):
    print(A.count(str(i)))

Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
rank = []

for i in range(1,N+1):
    print(A.count(i))


Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
rank = []

for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
rank = []

for i in range(1,N+1):
    rank.append(A.count(i))
    


for i in range(0,N+1):
    print(rank[i])
    

Fixed submission:
N = int(input())
A = input().split()

import collections
c = collections.Counter(A)

for i in range(1,N+1):
    print(c[str(i)])
Buggy python submission (verdict: Runtime Error):
lucky = input()
a = int (lucky[1])
b = int (lucky[2])
c = int (lucky[3])

if (a == 7) or (b == 7) or (c == 7) :
    print ("Yes")
else :
    print ("No")

Fixed submission:
lucky = input()
a = int (lucky[0])
b = int (lucky[1])
c = int (lucky[2])
 
if (a == 7) or (b == 7) or (c == 7) :
    print ("Yes")
else :
    print ("No")

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

for i in range(3)
	if int(lucky[i]) == 7 :
  		print ("Yes")
    else :
        print ("No")

Fixed submission:
lucky = input()
a = int (lucky[0])
b = int (lucky[1])
c = int (lucky[2])
 
if (a == 7) or (b == 7) or (c == 7) :
    print ("Yes")
else :
    print ("No")

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

for i in range(3)
	if int(lucky[i]) = 7 :
  		print ("Yes")
    else :
        print ("No")

Fixed submission:
lucky = input()
a = int (lucky[0])
b = int (lucky[1])
c = int (lucky[2])
 
if (a == 7) or (b == 7) or (c == 7) :
    print ("Yes")
else :
    print ("No")