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:
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

n = Next()

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

Submission status: Accepted

Solution code:
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

N = int(input())
sN = str(N)

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

Submission status: Accepted

Solution code:
def main():
    n=int(input())
    ans='No'
    for i in list(str(n)):
        if i=='7':
            ans='Yes'
    print(ans)

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
l = list(n)
if "7" in l:
    print("Yes")
else:
    print("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:
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math

import itertools
import heapq
#import bisect

import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]

def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)


def main():
    n=list(input())
    ans="No"
    for i in n:
        if i=="7":
            ans="Yes"
    print(ans)



if __name__ == "__main__":

    main()

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:
import sys
from collections import *
import heapq
import math
from math import gcd
import bisect
import copy
from itertools import permutations,accumulate,combinations,product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

n=input()
for i in range(len(n)):
    if n[i]=="7":
        print("Yes")
        break
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = str(input())

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

Submission status: Accepted

Solution code:
N = str(input())
s = "7"

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

Submission status: Accepted

Solution code:



def resolve():
    N = input()
    print("Yes" if "7" in N else "No")


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = input()

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

Submission status: Accepted

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10 ** 6)
    input = sys.stdin.readline
    N = input().strip()
    if '7' in N:
        print('Yes')
    else:
        print('No')
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
def examA():
    N = SI()
    ans = "No"
    for s in N:
        if s=="7":
            ans = "Yes"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return list(map(int,readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

if N.find('7')>-1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

for i in N:
    if i == '7':
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s
def factorial(n):
    if n == 1:
        return 1
    return n * factorial(n-1)
def mCn(m, n):
    def factorial_ntimes(m, n):
        r = 1
        while n:
            r *= m
            m -= 1
            n -= 1
        return r
    return int(factorial_ntimes(m, n) / factorial(n))

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000)

def solve(N):
    if "7" in str(N):
        return "Yes"
    return "No"

if __name__ == "__main__":
    N = int(input())
    print(solve(N))

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
s = str(n)
for i in range(3):
    if s[i] == '7':
        print('Yes')
        quit()
print('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:
N = input()
print("Yes" if N.count("7")>0 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    n = list(input())
    if '7' in n:
        print('Yes')
    else:
        print('No')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = input()
a = "No"
for i in list(n):
    if i == "7":
        a = "Yes"

print(a)

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import sys
import itertools
import queue
input = sys.stdin.readline
sys.setrecursionlimit(100000)
# mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


def main():
    N = input().strip()
    for s in N:
        if s == "7":
            print("Yes")
            return
    print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
for char in input():
    if char == '7':
        print("Yes")
        exit()

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N):
    return 'Yes' if '7' in set(N) else 'No'


def main():
    N = read_str()
    print(slv(N))


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:
# -*- coding: utf-8 -*-
n = input()

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

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# 
# 

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    N = input()
    if "7" in N: print("Yes")
    else: print("No")

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)

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

def solve(N: int):
    s = str(N)
    ret = NO
    for c in s:
        if c == '7':
            ret = YES
            break
    print(ret)
    return

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    S = input()
    for s in S:
        if s == '7':
            print('Yes')
            return
    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" if flag==1 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

Solution code:
import heapq
from collections import defaultdict, deque
from math import ceil, factorial
from fractions import gcd
import sys

sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7

si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
smii = lambda: sorted(map(int, input().split()))


S = si()

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

Submission status: Accepted

Solution code:
#x,y,z = list(map(int,input().split()))
# k = int(input())

n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def judge(n):
    return "7" in str(n)


def main():
    n = int(input())
    if judge(n):
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys

# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# import itertools
# from operator import attrgetter, itemgetter
# import math

# from numba import jit

# import numpy as np

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    n = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    N = input()
    return "Yes" if "7" in N else "No"


print(main())

Submission status: Accepted

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

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


def solve(N: str):
    for c in N:
        if c == "7":
            print(YES)
            exit()
    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 = next(tokens)  # type: int
    solve(N)

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:
def main():
    S = input()
    S = set(S)
    if "7" in S:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    N=readline().strip()
    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:
import sys
n=input()
print("Yes" if "7" in n 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:
N = str(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=int(input())

S=str(N)
if S.count("7")>=1:
  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:
n = input()
for i in range(len(n)):
    if n[i] == '7':
        print("Yes")
        exit()
print("No")

Submission status: Accepted

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

MOD = 10**9
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

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

Submission status: Accepted

Solution code:
n = input()

if n.count("7"):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input = raw_input

a = input()
if "7" in a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#MLE注意！

def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    n = input().rstrip()
    if '7' in n:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l = list(input())
print(["No","Yes"]['7' in l])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC162a


def main():
    import sys
    sys.setrecursionlimit(10**6)
    # 再帰関数を使わない限りPypyで出すこと

    def dump(*args):
        sys.stderr.write(str(args))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

for i in s:
    if i == "7":
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
#ここまでテンプレ
from sys import stdin,setrecursionlimit
setrecursionlimit(10 ** 7)
s = input()
if "7" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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:
X = input()

if ("7" in X):
    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:

N = input()

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

for n in N:
    if n == '7':
        print('Yes')
        quit(0)
print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


def MI(): return map(int, input().split())


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    s = S()

    for i in range(len(s)):
        if s[i] == '7':
            print('Yes')
            return

    print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input().strip()

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

Submission status: Accepted

Solution code:
N = list(input())

for i in N:
  if i == "7":
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(N: int):
    if "7" in str(N):
        yes()
    else:
        no()
    return


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:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
  return list(map(int,input().split()))
def m(): #複数文字
  return map(int,input().split())
def onem(): #Nとかの取得
  return int(input())
def s(x): #圧縮
  a = []
  if len(x) == 0:
    return []
  aa = x[0]
  su = 1
  for i in range(len(x)-1):
    if aa != x[i+1]:
      a.append([aa,su])
      aa = x[i+1]
      su = 1
    else:
      su += 1
  a.append([aa,su])
  return a
def jo(x): #listをスペースごとに分ける
  return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
  return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
  ll = 0
  rr = r
  while True:
    mid = (ll+rr)//2

  if rr == mid:
    return ll
  if (ここに評価入れる):
    rr = mid
  else:
    ll = mid+1
"""
n = input()[:-1]

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

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

if "7" in n:
    print("Yes")
else:
    print("No")
# n = int(input())
# h, w = map(int, input().split())
# a = list(map(int, input().split()))

Submission status: Accepted

Solution code:
n=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 = input()
if "7" in n:
	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:
N = str(input())
if "7" in N:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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