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:
if __name__ == '__main__':
    from sys import stdin
    input = stdin.readline

    n = input()
    for i in n:
        if i == '7':
            print('Yes')
            break
    else:
        print('No')

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from fractions import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main(): #startline-------------------------------------------
    print("Yes" if "7" in input() else "No")
if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

Solution code:
n = input()

if "7" in n:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():

    N = input()

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
mylist = list(input())

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int):
    return YES if '7' in str(N) else NO


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    print(solve(N))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    n = input()

    ret = "No"
    if "7" in n:
        ret = "Yes"

    return ret


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
N = list(map(int,list(input())))
ans = 0
for i in N:
    if i == 7:
        ans += 1
if ans == 0:
    print("No")
else:
    print("Yes")

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:
a = input()
if('7' in a):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())

x = n % 10
y = (n // 10) % 10
z = n // 100
if x == 7 or y == 7 or z == 7:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def resolve():
    S = input()
    for s in S:
        if int(s) == 7:
            ans = 'Yes'
            break
        else:
            ans = 'No'

    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a = input()

for c in a:
  if c == '7':
    print('Yes')
    exit()
print('No')

Submission status: Accepted

Solution code:
N = input()

if sum('7'==c for c in N) > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
N = list(input())
for i in range(len(N)):
    if N[i] == '7':
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
# A - Lucky 7

n = str(input())

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

Submission status: Accepted

Solution code:


############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
    return(int(input().rstrip()))
def inlt():
    return(list(map(int,input().rstrip().split())))
def insr():
    s = input().rstrip()
    return(s[:len(s) - 1])
def invr():
    return(map(int,input().rstrip().split()))
################################################################
n = input().strip()
print('Yes' if '7' in n else 'No')
#print('No')
#print()

Submission status: Accepted

Solution code:
n = input()
def solve():
    for i in range(len(n)):
        if n[i] == "7":
            return "Yes"
    return "No"

print(solve())

Submission status: Accepted

Solution code:
def main():
    s = input().rstrip()
    f = False
    for c in s:
        if c == "7":
            f = True
            break
    if f:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
m = s()
for i in range(3):
    if m[i] == "7":
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
def main():
    #n, k = map(int,input().split())
    k = input()
    j = 0
    for i in k:
        if i == '7':
            j = j+1
    if j>0:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

input_line = input()
N = list(input_line)

for i in N:
    if i=='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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


def inpl():
    return list(map(int, input().split()))


S = input().strip()

print("Yes" if "7" in S else "No")

Submission status: Accepted

Solution code:
ns = list(input())

for n in ns:
  if n == "7":
    print("Yes")
    break
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

for i in n:
    if i == '7':
        print('Yes')
        break
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=str(input())
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:
# coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
#################################### ########
n=input()
if n.count("7")>0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = input()
    a = n.count("7")
    if 0 < a:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N = int(input())

a = N //100
b = (N%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 = int(input())

digits = []
N_tmp = N
for i in range(10):
    digits.append(N_tmp % 10)
    N_tmp //= 10

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

Submission status: Accepted

Solution code:
N=int(input())
N=str(N)
cnt=0
for i in N:
  if i=="7":
    cnt+=1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
flag = 0
for i in N:
    if int(i)==7:
        flag=1
        break
    else:
        continue
        
if flag==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
n=int(input())
ans="No"
for i in range(3):
  if n%10==7:
    ans="Yes"
  n=n//10
print(ans)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(input())

flag = False

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

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

Submission status: Accepted

Solution code:

from sys import stdin
import sys
sys.setrecursionlimit(10**8)

def nextLine(): return next(stdin)
def nextStrList(): return nextLine().split()
def nextIntList(): return [int(_) for _ in nextStrList()]


def ox(s, i):
	return s[i]=="o"


def main():
	n=int(nextLine())
	if "7" in str(n):
		print("Yes")
	else:
		print("No")		
	
if __name__=="__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

print("No" if N[0] != "7" and N[1] != "7" and N[2] != "7"  else "Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def check(s):
    for i in range(len(s)):
        if s[i] != s[len(s)-1-i]:
            return False
    return True

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:
n = input()
found = False
for digit in n:
    found = found or digit=='7'
if found:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = input()
print(["No", "Yes"][any(x == "7" for x in n)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if str(N).count('7') > 0:
    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=int(input())
if (x%10==7) or (x%100>=70 and x%100<80) or (x>=700 and x<800):
	print('Yes')
else:
  	print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
flag = False
for i in n:
    if i == '7':
        flag = True
    
if flag:
    print('Yes')
    
else:
    print('No')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s=input()
print('Yes' if '7' in s else 'No')

Submission status: Accepted

Solution code:
n = int(input())
res = "No"

for i in range(3):
    if str(n)[i] == "7":
        res = "Yes"

print(res)

Submission status: Accepted

Solution code:
s = input()
yes = False
for c in s:
  if c == "7":
    yes = True
if yes: print("Yes")
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 = input()
a = n.__contains__("7")

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

Submission status: Accepted

Solution code:
n = input()

flag = False
for s in n:
    if s == '7':
        flag = True
        break

print('Yes') if flag else print('No')

Submission status: Accepted

Solution code:
N = str(input())
ans = False
for n in list(N):
    if n=='7':
        ans=True
if ans:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()

ans = False
for i in s:
    if i == '7':
        ans = True
        
print('Yes' if ans else'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:
k = int(input())
k = str(k)
if k[0]=="7" or k[1]=="7" or k[2]=="7":
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = int(input())

s_st = str(S)
if "7" in s_st:
    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()

l = len(n)

ans = 0

for i in range(l):
    if n[i] == '7':
        ans += 1
    else:
        pass

if ans >= 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    while N:
        if N % 10 == 7:
            print("Yes")
            return
        N = N//10
    print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = list(input())
print('Yes' if '7' in N else 'No')

Submission status: Accepted

Solution code:
from sys import stdin
import sys

# A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
# A,B = [int(x) for x in stdin.readline().rstrip().split()]
# U = input().split()
# A, B = [str(x) for x in stdin.readline().rstrip().split()]
s = list(input())
if s[0] == '7' or s[1] == '7' or s[2] == '7':
    print("Yes")
else:
    print("No")

# print("YES")
# print("NO")

Submission status: Accepted

Solution code:
s = input()
a = [int(c) for c in s]
for i in a:
    if i==7:
        print("Yes")
        exit()
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:
def main():
    N  = input()
    flag = False
    for i in range(len(N)):
        if N[i] == "7":
            flag = True
    if flag :
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = input()

if '7' in n:
    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 = input()
ans = "No"
for i in n:
    if i == "7":

        ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 162: A (2020/04/12)
N = str(input())
if N[0] == '7' or N[1] == '7' or N[2] == '7':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#coding:utf-8
N=input()
flag=False
for i in range(3):
	if N[i]=="7":
		flag=True
	
if flag:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=input()
f = False
for i in range(len(N)):
    if N[i] =="7":
            
        f=True
        print("Yes")
        break

if not f:
    print("No")

Submission status: Accepted

Solution code:
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
 
def sieves_of_e(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n+1, i): is_prime[j] = False
    return is_prime

N = input()

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

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

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#def main(S, b):
if __name__ == '__main__':
    # n, w, k, V = map(int, input().split())

    n = int(input())

    n = str(n)

    f = False
    for i in range(3):
        if (n[i] == '7'):
            f = True

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

Submission status: Accepted

Solution code:
N = list(input())

for a in N:
    if a == '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 = str(input())

ans = 'No'
for n in N:
    if n == '7':
        ans ='Yes'

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
n = list(input())
if '7' in n:
    print('Yes')
else:
    print('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:
n=input()

if n.count('7')>=1:
    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:
x=list(input())
print("Yes" if "7" in x else "No")

Submission status: Accepted

Solution code:
def main():
    N = input()
    N = [int(s) for s in N]
    
    if 7 in N:
        print('Yes')
    else:
        print('No')
    
    

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import *
import sys
try: inp = raw_input
except: inp = input
def err(s):
    sys.stderr.write('{}\n'.format(s))

def ni():
    return int(inp())

def nl():
    return [int(_) for _ in inp().split()]
N = inp()
if '7' in N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    N = readline().strip()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
status = False
for c in s:
    if c == "7":
        status = True

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

Submission status: Accepted

Solution code:
n = int(input())

if n % 10 == 7:
    ans = 'Yes'
elif (n % 100) // 10 == 7:
    ans = 'Yes'
elif n // 100 == 7:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
def resolve():
    N = list(input())

    for nn in N:
        if (nn == str(7)):
            print("Yes")
            return

    print("No")


resolve()

Submission status: Accepted

Solution code:
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

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

Submission status: Accepted

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

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

print('No')

Submission status: Accepted

Solution code:
n = str(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:
#A
n = input()
if n[2] == '7' or n[1] == '7' or n[0] == '7':
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
print('YNeos'['7' not in n::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if len([c for c in input() if c == '7']) >= 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int):
    for x in str(N):
        if x =="7":
            print(YES)
            return
    print(NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# 2020/04/12
# AtCoder Beginner Contest 162 - A

# Input
n = input()

# Calc
if n[0] == '7' or n[1] == '7' or n[2] == '7':
    ans = 'Yes'
else:
    ans = 'No'

# Output
print(ans)

Submission status: Accepted

Solution code:
import sys
N = str(input())
 
for n in range(len(N)):
    if N[n] == '7':
        print('Yes')
        sys.exit()
print('No')

Submission status: Accepted

Solution code:
n=input()
l=list(n)
val=0
for i in l:
    if i=="7":
        val=1
        break
if val==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = list(input())
ans = 0
for i in N:
    if int(i) == 7:
        ans = 1
if ans == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


def main():
    N = input()
    ok = False
    for i in range(3):
        if N[i] == '7':
            ok = True
    if ok:
        print("Yes")
    else:
        print("No")



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = input()
flag = 0
for i in range(3):
  if(N[i] == '7'):
    flag = 1
    print('Yes')
    break
if(flag == 0):
  print('No')