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:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x



if __name__ == '__main__':
    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()
if N.count("7") > 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n = int(input())

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

N = str(N)
if N.find('7') != -1:
    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:
def main():
    N = input()
    for n in N:
        if n == '7':
            print('Yes')
            return
    print("No")
if __name__ == '__main__':
    main()

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()
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:
s=input()
a=0
for i in range(3):
  if s[i]=='7':
    a=1
if a==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

if len(n) == len(n.replace('7','')):
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,math,copy,queue,itertools,bisect
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))

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

Submission status: Accepted

Solution code:
def main():
    a = input()
    for s in a:
        if s == "7":
            print("Yes")
            break
    else:
        print("No")
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

Solution code:
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:
n = int(input())

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

Submission status: Accepted

Solution code:


line = input()

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

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from heapq import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *				# bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin				# bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def f(flag):
	if(flag):
		return 'Yes'
	else:
		return 'No'

def solve(l):
	l = list(str(l))
	ff = 0
	if('7' in l):
		ff = 1
	return (f(ff))

N = int(stdin.readline())
print(solve(N))

Submission status: Accepted

Solution code:
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:
n = input().rstrip()
if '7' in n:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = input()
print('Yes' if '7' in k else '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:
mod = 10**9 + 7
mod2 = 2**61 + 1
int1 = lambda x: int(x) - 1
from collections import deque
import heapq
import time
from bisect import bisect_left, insort_left, bisect_right
import sys
import random
import itertools


# input = sys.stdin.readline
def input():
    return sys.stdin.readline().strip("\n").strip(" ")


_NUMINT_ALL = list(range(10))
_START_TIME = time.time()
INDEX_KETA = 10**12
INF = 9223372036854775807  # 符号つきlong longの最大値。10の18乗より大きく、10の19乗より小さい

def main():
    ans = solve()

    if ans is True or ans is False:
        YesNo(ans)
    elif ans is None:
        return

    elif isinstance(ans, tuple):
        split_print_space(ans)
    else:
        print(ans)


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



#####################################################ライブラリ集ここから


def kiriage_warizan(a, b):
    return -(-a // b)


def iip(listed=False):  # 数字のinputをlistで受け取る
    d = input().rstrip("\n").split()
    try:
        ret = [int(i) for i in d]
    except:
        ret = [int(i) if i in _NUMINT_ALL else i for i in d]
        if len(ret) == 1 and listed is False:
            return ret[0]

    if len(ret) == 1 and not listed:
        return ret[0]
    return ret


def iipt(l, listed=True):  # 縦向きに並んでいるデータをリストに落とし込む(iip利用)
    if isinstance(l, list):
        l = l[0]  # 間違って要素１個のタプルを渡されても受け取る
    assert isinstance(l, int)
    ret = []
    for i in range(l):
        ret.append(iip(listed=listed))
    return ret


def saidai_kouyakusuu(A):  # 最大公約数
    l = len(A)
    while True:
        m = min(A)
        mx = max(A)
        if m == mx:
            return m

        for i in range(l):
            if A[i] % m == 0:
                A[i] = m
            else:
                A[i] %= m


def flatten(l):
    return list(itertools.chain.from_iterable(l))


def index_sorted(sorted_list, target):
    idx = bisect_left(sorted_list, target)
    if idx != len(sorted_list) and sorted_list[idx] == target:
        return idx
    else:
        return False


def time_debug_10percent():
    a = random.randint(0, 9)
    if a == 9:
        sys.exit()


def time_debug(t):
    time.sleep(_START_TIME + t - time.time())
    sys.exit()


def make_graph_edge_flat(N):  # グラフ作成のための辺をリストで返す
    ret = []
    for i in range(N - 1):
        a, b, c = iip()
        a -= 1
        b -= 1
        ret[a].append((b, c))
        ret[b].append((a, c))
    return ret


def sort_tuples(l, index):  # タプルのリストを特定のインデックスでソートする
    if isinstance(l, list):
        l.sort(key=lambda x:x[index])
        return l
    else:
        l = list(l)
        return sorted(l, key=lambda x:x[index])


def count_elements(l):  # リストの中身の個数を種類分けして辞書で返す
    d = {}
    for i in l:
        if i in d:
            d[i] += 1
        else:
            d[i] = 1
    return d


def safeget(l, index, default="exception"):  # listの中身を取り出す時、listからはみ出たり
    if index >= len(l):  # マイナスインデックスになったりするのを防ぐ
        if default == "exception":
            raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。配列の長さは", len(l), "です"]))
        else:
            return default
    elif index < 0:
        if default == "exception":
            raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。負の値は許可されていません"]))
        else:
            return default
    else:
        return l[index]


def sortstr(s):  # 文字列をソートする
    return "".join(sorted(s))


def iip_ord(startcode="a"):  # 文字列を数字の列に変換する(数字と文字は1:1対応)
    if isinstance(startcode, str):
        startcode = ord(startcode)
    return [ord(i) - startcode for i in input()]


def YesNo(s):  # TrueFalseや1, 0をYesNoに変換する
    if s:
        print("Yes")
    else:
        print("No")


def fprint(s):  # リストを平たくしてprintする(二次元リストを見やすくしたりとか)
    if isinstance(s, int):
        print(s)
        return
    keta = max([len(str(i)) for i in itertools.chain.from_iterable(s)])
    print("--------")
    for i in s:
        print([str(j).rjust(keta) for j in i])
    print("--------")


def bitall(N):  # ビット全探索用のインデックスを出力
    ret = []
    for i in range(2**N):
        a = []
        for j in range(N):
            a.append(i % 2)
            i //= 2
        ret.append(a)
    return ret


def split_print_space(s):  # リストの中身をスペース区切りで出力する
    print(" ".join([str(i) for i in s]))


def split_print_enter(s):  # リストの中身を改行区切りで出力する
    print("\n".join([str(i) for i in s]))


def soinsuu_bunkai(n):  # 素因数分解
    ret = []
    for i in range(2, int(n**0.5) + 1):
        while n % i == 0:
            n //= i
            ret.append(i)
        if i > n:
            break
    if n != 1:
        ret.append(n)
    return ret


def conbination(n, r, mod, test=False):  # nCrをmodを使って計算する
    if n <= 0:
        return 0
    if r == 0:
        return 1
    if r < 0:
        return 0
    if r == 1:
        return n
    ret = 1
    for i in range(n - r + 1, n + 1):
        ret *= i
        ret = ret % mod

    bunbo = 1
    for i in range(1, r + 1):
        bunbo *= i
        bunbo = bunbo % mod

    ret = (ret * inv(bunbo, mod)) % mod
    if test:
        # print(f"{n}C{r} = {ret}")
        pass
    return ret


def inv(n, mod):  # modnにおける逆元を計算
    return power(n, mod - 2)


def power(n, p, mod_=mod):  # 繰り返し二乗法でn**p % modを計算
    if p == 0:
        return 1
    if p % 2 == 0:
        return (power(n, p // 2, mod_)**2) % mod_
    if p % 2 == 1:
        return (n * power(n, p - 1, mod_)) % mod_


def nibutan_func(func, target, left, right, side="left", seido=1):  # 関数を二分探索
    l = left
    r = right
    if seido == 1:
        x = (l + r) // 2
    else:
        x = (l + r) / 2
    while r - l > seido:
        # print(x)
        if seido == 1:
            x = (l + r) // 2
        else:
            x = (l + r) / 2
        if func(x) == target:
            if side == "left":
                r = x
            else:
                l = x


        elif func(x) > target:
            r = x
        else:
            # print(r, l)
            l = x

    # print(l, r)
    if side == "left" and func(r) == target:
        return r
    elif side != "left" and func(l) == target:
        return l
    elif side == "left":
        return l
    else:
        return r


def nibutan_list(list_, target, side="left"):  # リストを二分探索
    if not isinstance(list_, list):
        list_ = list(list_)

    l = 0
    r = len(list_)
    x = (l + r) // 2
    while r - l > 1:
        x = (l + r) // 2
        if list_[x] == target:
            return x
        elif list_[x] > target:
            r = x
        else:
            l = x

    if side == "left" or list_[x] == target:
        return l
    else:
        return r


class UfTree():
    def __init__(self, maxnum):
        self.parent = list(range(maxnum))
        self._size = [1] * maxnum
        self.rank = [0] * maxnum

    def size(self, a):
        return self._size[self.root(a)]

    def root(self, a):
        rank = 0
        cur = a
        while True:
            if self.parent[cur] == cur:
                # for i in path: # 経路圧縮
                #    self.parent[i] = cur
                return cur
            else:
                self.parent[cur] = self.parent[self.parent[cur]]
                cur = self.parent[cur]
                rank += 1

    def unite(self, a, b):
        ra = self.root(a)
        rb = self.root(b)
        if ra == rb:
            return self

        self._size[ra] += self._size[rb]
        self.parent[rb] = ra
        return self


if __name__ == "__main__":
    main()

Submission status: Accepted

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

N = int(input())

str_N = list(str(N))

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

Submission status: Accepted

Solution code:
N = input()
true_flag = False
for i in N:
    if i == "7":
        print("Yes")
        exit()
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()
    for n in N:
        if n == "7":
            return "Yes"
    return "No"


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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    n = int(input())
    strn = str(n)
    for i in range(len(strn)):
        if strn[i] == '7':
            print("Yes")
            return
    print("No")
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = input()
flag=False
for s in n:
    if s == '7':
        flag = True

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

Submission status: Accepted

Solution code:
def f(N):
    A=str(N)
    if "7" in A:
        return "Yes"
    else:
        return "No"
N=int(input())
print(f(N))

Submission status: Accepted

Solution code:
import math
import fractions
import collections
import itertools
N=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()




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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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
from io import StringIO
import unittest

def resolve():
    n = input()

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


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """117"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """123"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """777"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
N = list(str(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 = [x for x in input()]
if '7' in N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
import numpy as np
from collections import deque, Counter, defaultdict
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush, heapify
from bisect import bisect_left, bisect_right, bisect
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
from functools import reduce
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
def lcm_base(a, b):
    return (a * b) // gcd(a, b)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(input())

flag = False
for char in N:
  if char == '7':
    flag = True

if flag:
  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()
if n[0] != "7" and n[1] != "7" and n[2] != "7":
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
n = input()
flag = False
for c in n:
    if c == '7': flag = True
print("Yes" if flag else "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:
n = list(input())
print("Yes" if "7" in n else "No")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n = ns()

n = list(n)

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

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")

    return 0


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = list(map(int, input()))
if 7 in a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import Counter
from pprint import pprint

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

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col):
    data.sort(key=lambda x:x[col],reverse=False)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = list(str(input()))

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = input()
    if '7' in N:
        print('Yes')
    else:
        print('No')


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n = input()
for i in range(len(n)):
    if n[i] == str(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:
s = input()
a = False
for i in range(3):
  if s[i] == "7":
    a = True
if a:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


def main():
    print(Yes if '7' in input() else No)

main()

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()
if N[0]=='7' or N[1]=='7' or 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 = input()

ans = 'Yes'

if n.count('7') <= 0:
    ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
import sys
n=int(input())
N=str(n)
for i in range(len(N)):
  if N[i]=='7':
    print('Yes')
    sys.exit()
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()
    ans = False
    for i in range(len(N)):
        if N[i] == '7':
            ans = True
            break

    if ans ==False:
        print("No")
    else:
        print("Yes")

main()

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:
# -*- coding: utf-8 -*-
import numpy as np
N = (input())
# x, y, z = list(map(int, input().split()))
if '7' in N:
    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:
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
import math
from functools import reduce
from operator import mul
sys.setrecursionlimit(10**6)

def InMap(): return list(map(int, sys.stdin.readline().split(' ')))
def In(): return int(sys.stdin.readline())
def InS(): return sys.stdin.readline()

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

Submission status: Accepted

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

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 n):
  print("Yes")
else:
  print("No");

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    N = input().rstrip('\n')
    ok = 0
    for i in range(3):
        if N[i] == "7":
            ok = 1
    if ok:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 8)


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    #n=int(readline())
    ss=readline().rstrip()
    for s in ss:
        if s=="7":
            print("Yes")
            return
    print("No")
    #yn(1)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
# ABC162 A

def main():
    n = int(input())

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

Submission status: Accepted

Solution code:
N = list(input())

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