Problem:


Score : 100 points

Problem Statement

Given is a three-digit integer N. Does N contain the digit 7?

If so, print Yes; otherwise, print No.

Constraints

100 \leq N \leq 999

Input

Input is given from Standard Input in the following format:

N

Output

If N contains the digit 7, print Yes; otherwise, print No.

Sample Input 1

117

Sample Output 1

Yes

117 contains 7 as its last digit.

Sample Input 2

123

Sample Output 2

No

123 does not contain the digit 7.

Sample Input 3

777

Sample Output 3

Yes



Sample input:
117


Sample output:
Yes

Submission status: Accepted

Solution code:
N = input()
for e in N:
    if e == '7':
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
print('Yes'if input().count('7')>0else 'No')

Submission status: Accepted

Solution code:
N = input()

if N[0] == '7' or N[1] == '7' or N[2] == '7':
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
A = 1
N = str(input())
for i in N:
  if int(i) == 7:
    print("Yes")
    exit()
  else:
    A = 0
    
if A == 0:
  print("No")

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
n=input()

if '7' in str(n):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	N = inputInt()
	s = str(N)

	if s[0] == "7" or s[1] == "7" or s[2] == "7":
		print("Yes")
	else:
		print("No")

	#print(N)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
class Graph(object):
    """
    隣接リストによる有向グラフ
    """

    def __init__(self):
        self.graph = defaultdict(list)

    def __len__(self):
        return len(self.graph)

    def add_edge(self, src, dst, weight=1):
        self.graph[src].append((dst, weight))

    def get_nodes(self):
        return self.graph.keys()


class Dijkstra(object):
    """
    ダイクストラ法（二分ヒープ）による最短経路探索
    計算量: O((E+V)logV)
    """

    def __init__(self, graph, start):
        self.g = graph.graph

        # startノードからの最短距離
        # startノードは0, それ以外は無限大で初期化
        self.dist = defaultdict(lambda: float('inf'))
        self.dist[start] = 0

        # 最短経路での1つ前のノード
        self.prev = defaultdict(lambda: None)

        # startノードをキューに入れる
        self.Q = []
        heappush(self.Q, (self.dist[start], start))

        while self.Q:
            # 優先度（距離）が最小であるキューを取り出す
            dist_u, u = heappop(self.Q)
            if self.dist[u] < dist_u:
                continue
            for v, weight in self.g[u]:
                alt = dist_u + weight
                if self.dist[v] > alt:
                    self.dist[v] = alt
                    self.prev[v] = u
                    heappush(self.Q, (alt, v))

    def shortest_distance(self, goal):
        """
        startノードからgoalノードまでの最短距離
        """
        return self.dist[goal]

    def shortest_path(self, goal):
        """
        startノードからgoalノードまでの最短経路
        """
        path = []
        node = goal
        while node is not None:
            path.append(node)
            node = self.prev[node]
        return path[::-1]

def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))

# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    while N:
        N, r = divmod(N, 10)
        if r == 7:
            print('Yes')
            return
    print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = input()
f=0
for i in n:
  if i=='7':
    f=1
    
if f:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a=list(input())
l=len(a)
count=0
for i in range(l):
    if a[i]=="7":
        count=1
        break
if count==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()
for i in range(3):
    if n[i] == '7':
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
N = input()
print('Yes' if '7' in N else 'No')

Submission status: Accepted

Solution code:
#162a
import math
#数字の各桁の抽出,桁抽出
N = int(input())

#Nを下の桁から取る
while N!=0:
    ketasu = int(math.log10(N)//1 + 1)
    top_keta = N // 10**(ketasu-1)
    #print(top_keta)
    if top_keta == 7:
        print("Yes")
        break
    N = N - top_keta*10**(ketasu-1)
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
 
if  N > 999 or N < 100:
    print("error")
 
elif str(N)[-1] == '7':
  print("Yes")
elif str(N)[-2] == '7':
  print("Yes")
elif str(N)[-3] == '7':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def main():
    N = input()
    if '7' in N:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

N = list(input())

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

Submission status: Accepted

Solution code:
n = input()
ans = "No"
for c in n:
    if c == "7":
        ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
n = input()
if n.count("7") == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
number = input()
if '7' in number:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print("NYoe s"["7"in input()::2])

Submission status: Accepted

Solution code:
a = [0, 0, 0]
num = int(input())
a[0] = num // 100
a[1] = num % 100 // 10
a[2] = num % 100 % 10
if ((a[0] == 7) or (a[1] == 7) or (a[2] == 7)):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#数字の各桁の抽出
N = int(input())

while N!=0:
    last_keta = N - ((N//10) * 10)
    if last_keta == 7:
        print("Yes")
        break
    N = N//10
else:
    print("No")

Submission status: Accepted

Solution code:
N=str(input())

if N.count('7')>0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N=int(input())
if int(N/100)==7 or int((N%100)/10)==7 or N%10==7:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A = input()

if '7' in A:
    ans = 'Yes'
else:
    ans = 'No'
    
print(ans)

Submission status: Accepted

Solution code:
k=1
for i in input():
 if i=='7':k=0
print('YNeos'[k::2])

Submission status: Accepted

Solution code:
n, = map(int, open(0).read().split())
a = int(n / 100)
b = int((n % 100) / 10)
c = int((n % 100) % 10)

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

Submission status: Accepted

Solution code:
S  =str(input())

ans = "No"
for s in S:
  if s =="7":
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
n=input()
if '7' in n: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
a=input()
if '7' in a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=input()

ans="No"

for i in range(len(n)):
    if n[i] == "7":
        ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
N = input()
if int(N[0]) == 7 or int(N[1]) == 7 or int(N[2]) == 7:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

N = input().strip()

for i in range(3):
    if N[i] == '7':
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
print("YNeos"["7" not in input()::2])

Submission status: Accepted

Solution code:
inputStr = input()

out = 'No'
for c in inputStr:
    if c == '7':
        out = 'Yes'

print(out)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
 
n = int(input())
 
n = list(str(n))
 
flag = 0
 
for i in n:
    if i == str(7):
        flag = 1
 
print("Yes" if flag == 1 else "No")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N=input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

n = int(input())

n = list(str(n))

flag = 0

for i in n:
    if i == str(7):
        flag = 1

print("Yes" if flag == 1 else "No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


N = input()
print('Yes' if '7' in N else 'No')

Submission status: Accepted

Solution code:
N= input()

if(N[0] == str(7)):
    print("Yes")
elif(N[1] == str(7)):
    print("Yes")
elif(N[2] == str(7)):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = input()
 
print('Yes' if '7' in str(N) else 'No')

Submission status: Accepted

Solution code:
N = input()
print("Yes" if N.__contains__("7") else"No")

Submission status: Accepted

Solution code:
N= input()
if ('7' in N):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
number = input()
print("Yes" if('7' in number) else "No")

Submission status: Accepted

Solution code:
N = input()

if N[0]!='7' and N[1] != '7' and N[2] != '7' :
    print('No')

else :
    print('Yes')

Submission status: Accepted

Solution code:
#A

n = int(input())

if n // 100 == 7:
    print('Yes')
    exit()

else :
    a = n // 100

    n_2 = n - a * 100

    if n_2 // 10 == 7:
        print('Yes')
        exit()

    else :
        b = n_2 // 10

        n_3 = n_2 - b * 10

        if n_3 == 7:
            print('Yes')
            exit()
    
print('No')

Submission status: Accepted

Solution code:
print('Yes')if(input().count('7'))>=1else print('No')

Submission status: Accepted

Solution code:
print('Yes')if(input().count('7'))>=1 else print('No')

Submission status: Accepted

Solution code:
n = [int(x) for x in input()]
if 7 in n:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
print('Yes') if (input().count('7')) >= 1 else print('No')

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    N = input()
    if "7" in N:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n=input()
print('Yes') if (n.count('7')) >= 1 else print('No')

Submission status: Accepted

Solution code:
N = input()

result = False

for i in N:
  if i == '7':
    result = True

print("Yes" if result else "No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = input()

if '7' in str(x):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N = input()
if N.find('7') != -1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N = input()
if '7' in str(N):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = input()
if '7' in x:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
num = [int(x) for x in input()]

for i in range(3):
    if num[i] == 7:
        print("Yes")
        break
    elif i == 2:
        print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
data = input()

if data[0] == "7" or data[1] == "7" or data[2] == "7":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
num = input()
if num.count('7') != 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n=int(input())
flag=0
while n>0:
  ch=n%10
  n=n//10
  if ch==7:
    flag=1
if flag==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n = input()
for s in n:
    if s == "7":
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
N=input()
print("Yes") if N[0]=="7" or N[1]=="7" or N[2]=="7" else print("No")

Submission status: Accepted

Solution code:
print(["No", "Yes"]["7" in input()])

Submission status: Accepted

Solution code:
S=input()
for n in S:
    if n == '7':
        print('Yes')
        quit()
print('No')

Submission status: Accepted

Solution code:
N=input()
if '7' in N:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
n = int(input())
flag = 0
for i in range(3):
  t = n%10
  if t == 7:
    print("Yes")
    flag = 1
    break
  n = int(n/10)
if flag == 0:
  print("No")

Submission status: Accepted

Solution code:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
a = n//100
b = (n-a*100)//10
c = n-a*100-b*10
if (a == 7)or(b == 7)or(c == 7):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = int(input())
nums = [int(d) for d in str(a)]
if nums[0] == 7:
  print("Yes")
elif nums[1] ==7:
  print("Yes")
elif nums[2]==7:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = (input())
print('Yes')if '7' in N else print('No')

Submission status: Accepted

Solution code:
N = input()
ans = 'No'
for _ in N:
  if _ == '7':
    ans = 'Yes'
    
print(ans)

Submission status: Accepted

Solution code:
n = input()
if n.find("7") != -1:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
print("Yes" if "7" in list(input()) else "No")

Submission status: Accepted

Solution code:
n = int(input())
flag = False
while n>0:
    rem  = n%10
    if rem == 7:
        print ("Yes")
        flag = True
        break
    n = n//10
if flag == False:
    print("No")

Submission status: Accepted

Solution code:
N = input()
if '7' in str(N):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()

for i in N:
    if i == '7':
        ans = 0
        break
    else:
        ans = 1

if ans == 0:
    print("Yes")
else:
    print('No')

Submission status: Accepted

Solution code:
n = list(input())
if '7' in n:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
print(["No","Yes"][int("7" in input())])

Submission status: Accepted

Solution code:
N=str(input())
print("Yes" if N[0]=="7" or N[1]=="7" or N[2]=="7" else "No")

Submission status: Accepted

Solution code:
N = int(input())

A = N//100
B = (N-A*100)//10
C = N-A*100-B*10

if ( A == 7 ):
        print("Yes")
elif ( B == 7 ):
        print("Yes")
elif ( C == 7):
        print("Yes")
else:
        print("No")

Submission status: Accepted

Solution code:
a,b,c= input().strip()


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

Submission status: Accepted

Solution code:

#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))




n=str(input1())

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

Submission status: Accepted

Solution code:
N = int(input())

A = N // 100
B = (N-A*100)//10 
C = N % 10


if A==7 or B==7 or C==7:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=tuple(map(int, input().split()))
n=str(n)
c=n.count("7")
if(c>0):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = input ()
if '7' in str(N):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c = input()
f = 0
if a in '7' or b in '7' or c in '7':
    print('Yes')
    f = 1
if f == 0:
    print('No')

Submission status: Accepted

Solution code:
import sys

N=list(input())

for i in range(3):
  if (N[i]=='7'):
    print('Yes')
    sys.exit()
print('No')

Submission status: Accepted

Solution code:
N = list(input())
if '7' in N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# 初期入力
N = input()

#
if "7" in N:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=int(input())
if a%10==7 or int(a/10)%10==7 or int(a/100)==7:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()

ans = "No"
if N[0] == "7" or N[1] == "7" or N[2] == "7":
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
if '7' in input():
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
A = input()
Alist = list(A)
j=0
for i in range(3):
    if Alist[i] == '7':
        j+=1
if j>=1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = input("")
if n[0]=="7" or n[1]=="7" or n[2]=="7":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x=input()
y=str(x)
if int(y[-1])==7:
   print("Yes")
elif int(y[-2])==7:
   print("Yes")
elif int(y[-3])==7:
   print("Yes")
else:
   print("No")

Submission status: Accepted

Solution code:
inp=input()
ok=0
for i in range(len(inp)):
  if(inp[i]=='7'):
    print("Yes")
    ok=1
    break
if(ok==0):
  print("No")

Submission status: Accepted

Solution code:
S = (list(input()))
if S[0] == "7" or S[1] == "7" or S[2] == "7":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print("Yes" if(input().count('7')) else "No")

Submission status: Accepted

Solution code:
N = int(input())
if "7" in str(N): print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
n = input()
n = str(n)
if '7' in n:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n=input()
a="7" in n

if a==True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = input()
if int(N[0]) == 7 or int(N[1]) == 7 or int(N[2]) == 7:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

Solution code:
n = str(input())
x = 0
for num in n:
    if int(num) == 7 :
        x += 1
if x == 0 :
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import sys
n = list(input())

for i in range(3):
    if n[i] == "7":
        print("Yes")
        sys.exit()

print("No")

Submission status: Accepted

Solution code:
K=str(input())
if (int(K[0])%7==0 and int(K[0])!=0 )or (int(K[1])%7==0 and int(K[1])!=0 ) or (int(K[2])%7==0 and int(K[2])!=0 ):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = input()
 
if '7' in n:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
Degit = int(input())
print('Yes' if '7' in str(Degit) else 'No')

Submission status: Accepted

Solution code:
n=input()
cnt=n.count("7")
if cnt!=0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = str(input())
enc = 0

for char in list(N):
  if char == "7":
    enc += 1
    
if enc >= 1:
  print("Yes") 
else:
  print("No")

Submission status: Accepted

Solution code:
N = input()
l = [int(x) for x in list(str(N))]
cnt = 0

for i in range(3):
    if l[i] == 7:
        cnt += 1

if cnt >= 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
s=0
if int(N/100) == 7:
    print("Yes")
    s+=1
    

N = N % 100 
    

if s==0 and int(N / 10) == 7:
    print("Yes")
    s+=1

N = N % 10 

if s==0 and N / 1 == 7:
    print("Yes")
    s+=1
if s == 0:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
N1 = N//100
N2 = (N%100)//10
N3 = (N%100)%10
if N1 == 7 or N2 == 7 or N3 == 7:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = input()  # 1234を整数(int)型ではなく、文字列(str)型で変数に格納する
if(a=="7" or b=="7" or c=="7"): print("Yes")
elif( a=="7" and b=="7"): print("Yes")
elif( c=="7" and b=="7"): print("Yes")
elif( c=="7" and a=="7"): print("Yes")
elif(a=="7" and b=="7" and c=="7"): print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
n=int(input())
s=int(n/100)
if s==7:
    print("Yes")
    exit()
elif n%10 == 7:
    print("Yes")
    exit()
elif n%100>=70 and n%100<80:
    print("Yes")
    exit()
else:
    print("No")

Submission status: Accepted

Solution code:
num = int(input())
N = [int(i) for i in str(num)]
if N[0] == 7:
    print("Yes")
elif N[1] == 7:
    print("Yes")
elif N[2] == 7:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = input()

if(a.count("7")!=0):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
i = input()
if i[0] == '7' or i[1] == '7' or i[2] == '7':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()

result = "No"

for n in N:
  if n == "7":
    result = "Yes"

print(result)

Submission status: Accepted

Solution code:
#=--Lucky 7

N = input()

if (N[:1] == "7" or N[1:2] == "7" or N[2:3] == "7"):
  print ("Yes")
else:
  print ("No")

Submission status: Accepted

Solution code:

has_seven = False
N = str(input())
for i in range(len(N)):
  if N[i] == '7':
      has_seven = True
      break

if has_seven:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n=input().count('7')
if n>0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = raw_input().strip()

if '7' in s:
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
num = int(input())
n100 = num - 700
n10 = num - 70
n1 = num - 7
if n100  <= 99 and 0 <= n100:
  print("Yes")
elif n10 % 100 >= 0 and n10 % 100 <=9:
  print("Yes")
elif n1 % 10 == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def check(n):
	while n > 0:
		if n%10 == 7:
			return "Yes"
		n = int(n/10)
	return "No"

no = int(input())
print(check(no))

Submission status: Accepted

Solution code:
n = eval(input())
m = [int(d) for d in str(n)]

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

Submission status: Accepted

Solution code:

N = int(input())

n100 = int(N/100)
n10 = int((N-n100*100)/10)
n1 = int(N - n100*100 - n10*10 )
if n100==7 or n10==7 or n1==7 :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = str(input())
flag = 0

for i in range(3):
    if N[i] == "7":
        flag = 1

if flag == 1:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()

if n.find('7') >= 0 :
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = str(input())
l_N = list(N)
flg = 0
for i in range(len(l_N)):
    if l_N[i] == '7':
        print('Yes')
        flg = 1
        break
if flg == 0:
    print('No')

Submission status: Accepted

Solution code:
n = list(input())
ans = 'No'
for d in n:
    if d == '7':
        ans = 'Yes'
        break

print(ans)

Submission status: Accepted

Solution code:
def main():
  n = input()
  print("Yes" if n.count("7") > 0 else "No")
  

if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
s = input()
ans = 0
for v in range(3):
  if int(s[v]) == 7:
    ans += 1
    break
if ans == 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
N=input()
s=str(N)
s1=s[-1]
s2=s[-2]
s3=s[-3]
if s1 == '7':
    print('Yes')
elif s2 == '7':
    print('Yes')
elif s3=='7':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = input()
target = '7';
if(x[0]==target or x[1]==target or x[2]==target):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

n = list(input())
flag = False

for e in n:
    if e == '7':
        flag = True

if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()
n_list = [int(i) for i in list(str(n))]
if 7 in n_list:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = str(input())
a = x[0]
b = x[1]
c = x[2]

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

Submission status: Accepted

Solution code:
def main():
    n = input()
    for c in n:
        if c == '7':
            print('Yes')
            return

    print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = n // 100
b = (n - a*100) // 10
c = (n - a*100 - b*10)
if a == 7 or b == 7 or c ==7:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
'''input
10
'''

import math
s = input()
if '7' in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
if s[0]=="7" or s[1]=="7":
    print("Yes")
elif s[2]=="7":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
#数値ひとつ
#I = int(input())
#数値欲しいとき
#H, W = map(int, input().split())
#文字欲しいとき

N = input()
listA = list(N)

A = listA[0]
B = listA[1]
C = listA[2]

bool = False

if A == '7':
    bool = True

elif B == '7':
    bool = True

elif C == '7':
    bool = True


if bool == True:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
tmp = input()
if '7' in tmp:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import math
n = int(input())
for i in range(3):
  if n%10 == 7:
    print('Yes')
    break
  elif n/10 < 1:
    print('No')
  else:
    n = math.floor(n/10)

Submission status: Accepted

Solution code:
print({True:"Yes",False:"No"}['7' in input()])

Submission status: Accepted

Solution code:


N = input()
 
print('Yes' if '7' in str(N) else 'No')

Submission status: Accepted

Solution code:
a = input()
b = str(a)
if '7' in b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
t=input()
if t.count("7")!= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c= input()
a=int(a)
b=int(b)
c=int(c)
if a ==7 or b==7 or c==7:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n=str(input())
a=str(7)
if n[-1]==a or n[-2]==a or n[-3]==a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N=int(input())

for i in range(0,10):
    for j in range(0,10):
        for k in range(0,10):
            if N==100*i+10*j+k:
                if i==7 or j==7 or k==7:
                    print("Yes")
                else:
                    print("No")
            else:
                pass

Submission status: Accepted

Solution code:
N = str(input())
a = 0
for i in range(3):
    if N[i] == '7':
        a += 1
if a >0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()
print("Yes" if N.__contains__("7") else "No")

Submission status: Accepted

Solution code:
flag=0;
a = input()
for i in range(3):
  if a[i] == "7":
    flag = 1
if flag == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n=str(input())
for i in range(len(n)):
    if n[i]=="7":
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
a = str(input())
b = a[0]
c = a[1]
d = a[2]
if b == "7" or c == "7" or d == "7":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
a = n % 10
b = (n % 100) // 10
c = n // 100
if (a == 7 or b == 7 or c == 7) :
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = input()
print('Yes' if '7' in str(N) else 'No')

Submission status: Accepted

Solution code:

s = input()
if '7' in s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N=input()
if N[0] == '7' or N[1] == '7' or N[2] == '7': 
    print('Yes') 
else: 
    print('No')

Submission status: Accepted

Solution code:
N=int(input())

l=[int(x) for x in list(str(N))] 
if 7 in l:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
x = input()
if ("7" in x) == True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
data = input()

if data.find("7") != -1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
string = input()
list_of_integers =[int(d) for d in str(string)]

l = len(list_of_integers)
ans = "No"
for i in list_of_integers:
  if (i == 7):
    ans = "Yes"
  
print(ans)

Submission status: Accepted

Solution code:
a = input()
if a[0]=="7" or a[1] == "7" or a[2]=="7":
  print("Yes")
else:
  print("No")