Problem:


Score : 200 points

Problem Statement

Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.

Given an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.

Constraints

1 \leq N \leq 100

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.

Sample Input 1

10

Sample Output 1

Yes

10 can be represented as, for example, 2 \times 5.

Sample Input 2

50

Sample Output 2

No

50 cannot be represented as the product of two integers between 1 and 9.

Sample Input 3

81

Sample Output 3

Yes



Sample input:
10


Sample output:
Yes

Submission status: Accepted

Solution code:
n = int(input())
f = False
for i in range(1, 10):
	for j in range(1, 10):
		if i * j == n:
			f = True
print("Yes" if f else "No")

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    if N % i == 0 and 1 <= N // i <= 9:
        print('Yes')
        break
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())

for a in range(1, 10):
    if N % a != 0:
        continue

    if N // a > 9:
        continue

    print('Yes')
    break
else:
    print('No')

Submission status: Accepted

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

import sys

a=int(input())

for i in range(10):
    for j in range(10):
        if i * j == a:
            print("Yes")
            sys.exit()
print("No")

Submission status: Accepted

Solution code:
import sys
n = int(input())
for i in range(1,10):
  for j in range(1,10):
    if (i*j == n):
      print('Yes')
      sys.exit(0)
print('No')

Submission status: Accepted

Solution code:
N = int(input())

def check(N):
	for i in range(1, 10):
		if N % i == 0 and N // i < 10:
			print("Yes")
			return
	print("No")

check(N)

Submission status: Accepted

Solution code:
n = int(input())
s = set()
for i in range(1,10):
  for j in range(1,10):
    s.add(i*j)
if n in s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
words = lambda t : list(map(t, input().split()))
n = int(input())

ans = False
for i in range(1,10):
    for j in range(1,10):
        if n == i*j:
            ans = True

if ans:
    print("Yes")
else:
    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 main():
    n = ri()
    for a in range(1, 10):
        for b in range(1, 10):
            if a*b == n:
                print("Yes")
                return
    print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
a="No"
for i in range(10):
    for j in range(10):
        if i*j==n:
            a="Yes"
print(a)

Submission status: Accepted

Solution code:
N=int(input())
ans=0
for i in range(9):
  for j in range(9):
    if((i+1)*(j+1)==N):
      ans=1
if(ans):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
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)]

    N = int(input())
    for i in range(1,10):
        if N % i == 0:
            if N // i < 10:
                print('Yes')
                return
    print('No')



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

flag=False
for i in range(1,10):
    for j in range(1,10):
        if N==i*j:
            flag=True

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

Submission status: Accepted

Solution code:
N=int(input())
flg=False
for i in range(10):
    for j in range(10):
        if N==i*j: flg=True
print("Yes" if flg else "No")

Submission status: Accepted

Solution code:
N=int(input())

can = False
for a in range(10):
    for b in range(10):
        if a*b == N:
            can = True
            break

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

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1,10):
    for j in range(1,10):
        if n == i*j:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    ans = set()
    for i in range(1, 10):
        for j in range(1, 10):
            ans.add(i*j)
    print("Yes" if N in ans else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
s = set()
for i in range(1, 10):
    for j in range(1, 10):
        s.add(i*j)
if (N in s):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1,10):
  for j in range(1,10):
    if i*j == n:
      print("Yes")
      exit()
    else:
      continue
print("No")

Submission status: Accepted

Solution code:
N = int(input())
flag = False
for i in range(1, 10):
    if N % i == 0 and N // i <= 9:
        flag = True
        break
if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
lis = set()
for i in range(1, 10):
    for j in range(1, 10):
        lis.add(i*j)
if n in lis:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    n = input()
    for i in xrange(1, 10):
        for j in xrange(1, 10):
            if i * j == n:
                print('Yes')
                return
    print('No')

main()

Submission status: Accepted

Solution code:
n = int(input())
for a in range(1, 10):
    for b in range(1, 10):
        if n == a * b:
            print('Yes')
            exit(0)
print('No')

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        if N // i < 10:
            print("Yes")
            exit(0)
print("No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

debug = True
debug = False

def dprint(*objects):
    if debug == True:
        print(*objects)

def warshall_floyd(d):
    #d[i][j]: iからjへの最短距離
    n = len(d)
    for k in range(n):
        for i in range(n):
            for j in range(n):
                d[i][j] = min(d[i][j],d[i][k] + d[k][j])
    return d

def solve():
    N = II()

    for i in range(1, 10):
        for j in range(i, 10):
            if N == i*j:
                print('Yes')
                return
    print('No')

solve()

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        if 1 <= N//i <= 9:
            print("Yes")
            exit()
print("No")

Submission status: Accepted

Solution code:
n = int(input())
ans = "No"
for i in range(1,10):
    for j in range(1,10):
        if n==i*j:
            ans = "Yes"
            break

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
a = [1]
ans = "No"
for i in range(1,10):
    for j in range(1,10):
        a.append(i*j)
if a.count(N)>0:
    ans ="Yes"
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == n:
            print('Yes')
            exit()

print('No')

Submission status: Accepted

Solution code:
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i*j == n:
            print("Yes")
            exit()
print("No")

Submission status: Accepted

Solution code:
N = int(input())
valid = False
for i in range(1,10):
    if N%i == 0:
        if N//i < 10:
            valid = True
            break
print('Yes' if valid else 'No')

Submission status: Accepted

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

def main():
    N = int(input())
    ans = []
    for i in range(1, 10):
        for j in range(1, 10):
           ans.append(i * j)

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

    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
ans = False
for i in range(1, 10):
    if n % i == 0:
        if n // i < 10:
            ans = True
print(["No", "Yes"][ans])

Submission status: Accepted

Solution code:
n=int(input())
for i in range(1,10):
    if 1<=n//i<10 and (n//i)*i==n:
        print("Yes")
        break
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1,10):
  a = N % i
  b = N // i
  if(a == 0 and b < 10):
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
def main():
    N = int(input())

    ans = 'No'
    for i in range(1, 10):
        for j in range(1, 10):
            r = i * j
            if r == N:
                ans = 'Yes'

    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())

for i in range(1,10):
    for j in range(1,10):
        if n == i*j:
            print("Yes")
            exit()
print("No")

Submission status: Accepted

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


def main():
    N = int(input())
    for i in range(1, 10):
        for j in range(1, 10):
            if i*j == N:
                print("Yes")
                return
    print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

l=[]
for i in range(1,10):
    for j in range(1,10):
        l.append(i*j)
n=int(input())
if n in l:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = lambda: sys.stdin.readline()[:-1]
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7

n=int(input())
for i in range(1,10):
    for j in range(1,10):
        if n==i*j:
            print('Yes')
            exit()

print('No')

Submission status: Accepted

Solution code:
n=int(input())
def ans():
    for i in range(1,10):
        for j in range(1,10):
            if i*j==n:
                print("Yes")
                return
    print("No")
    
ans()

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        if int(N / i) < 10:
            print("Yes")
            exit(0)
print("No")

Submission status: Accepted

Solution code:
N=int(input())
L=[]
for i in range(1,10):
    for j in range(1,10):
        L.append(i*j)
if N in L:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

INF = float("inf")

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

#処理内容
def main():
	N = int(input())
	judge = "No"
	for i in range(1, 10):
		for j in range(1, 10):
			if N == i * j:
				judge = "Yes"
				break
	print(judge)

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == n:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
a = int(input())
for i in range(1,10):
    for j in range(1,10):
        if i*j == a:
            print("Yes")
            exit()
print("No")

Submission status: Accepted

Solution code:
n=int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if n==i*j:
            print("Yes")
            quit()
print("No")

Submission status: Accepted

Solution code:
import sys
N = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            print('Yes')
            sys.exit()
print('No')

Submission status: Accepted

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


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



def main():
    a = ii()
    for i in range(1,10):
        for j in range(1,10):
            if a == i*j:
                print('Yes')
                exit()
    print('No')

main()

Submission status: Accepted

Solution code:
n = int(input())
ans = "No"
for i in range(1,10):
    if n % i == 0 and n//i <= 9:
        ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
answer = 'No'
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            answer = 'Yes'
print(answer)

Submission status: Accepted

Solution code:
a = int(input())
seen = set()
for i in range(1,10):
    for k in range(1,10):
        seen.add(i*k)
if a in seen:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            print("Yes")
            exit()

print("No")

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
for i in range(1, 10):
  for j in range(1, 10):
    if i * j == N:
      print("Yes")
      exit()
print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import array
import math
import os
import sys


def main():
    N = read_int()
    for x in range(1, 10):
        for y in range(x, 10):
            if x * y == N:
                print('Yes')
                return
    print('No')


###############################################################################
# AUXILIARY FUNCTIONS

DEBUG = 'DEBUG' in os.environ


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


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
for i in range(9):
    i+=1
    if n%i==0 and n//i<=9:
        print("Yes")
        exit()
    else:
        continue
print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000)
INF = 1<<32

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

def solve(N: int):
    f = True
    for i in range(1,10):
        if(N%i == 0 and N//i <= 9):
            f = True
            break
        else:
            f = False

    if f:
        print(YES)
    else:
        print(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:
n = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if i*j == n: print("Yes"); exit()
print("No")

Submission status: Accepted

Solution code:
n = int(input())
l = []
for i in range(10):
    for j in range(10):
        if i*j not in l:
            l.append(i*j)

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

Submission status: Accepted

Solution code:
N = int(input())
flag = 0
for i in range(1, 10):
    for j in range(1, 10):
        if N == i*j:
            flag = 1

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N=int(input())

for i in range(1,10):
    if N%i==0:
        if N//i>9:
            pass
        else:
            print("Yes")
            exit()

print("No")

Submission status: Accepted

Solution code:
def main():
    n=int(input())
    s=set()
    for i in range(1,10):
        for j in range(1,10):
            s.add(i*j)
    if n in s:
        print("Yes")
    else:
        print("No")
    
main()

Submission status: Accepted

Solution code:
N=int(input())
List=[a*b for a in range(1,10) for b in range(1,10)]
if N in List:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, atan2
from operator import mul
from functools import reduce
sys.setrecursionlimit(10**8)

INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


def main():
    n = I()
    for i in range(1, 10):
        for j in range(1, 10):
            if i * j == n:
                return 'Yes'
    else:
        return 'No'



print(main())

Submission status: Accepted

Solution code:
n = int(input())
ans = False
for a in range(1, 10):
    if n % a == 0:
        b = n // a
        if 1 <= b and b <= 9:
            ans = True
print('Yes' if ans else 'No')

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
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 = []
    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



n = onem()

for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            print("Yes")
            exit()

print("No")

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    if N % i == 0 and N // i < 10:
        print('Yes')
        break
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())
flag = False
for i in range(1, 10):
    for j in range(1, 10):
        if N == i*j:
            flag = True
if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
l=[]
for i in range(1,10):
    for j in range(i,10):
        l.append(i*j)
N=int(input())
if N in l:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1, 10):
  for j in range(1, 10):
    if i * j == n:
      print("Yes")
      exit()
print("No")

Submission status: Accepted

Solution code:
n=int(input())
for i in range(10):
    for j in range(10):
        if i*j==n:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
n = int(input())
flg = False
for i in range(1,10):
    for j in range(1,10):
        if i * j == n:
            flg = True
if flg:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
  if N % i:
    continue
  if N // i < 10:
    print('Yes')
    break
else:
  print('No')

Submission status: Accepted

Solution code:
from sys import stdin


def input():
    return stdin.readline()[:-1]


def intput():
    return int(input())


def sinput():
    return input().split()


def intsput():
    return map(int, sinput())



table = [False] * 1000


for a in range(1, 10):
    for b in range(1, 10):
        table[a * b] = True


n = intput()

if table[n]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A=[]
for i in range(10):
    for j in range(10):
        A.append(i*j)

print("Yes" if int(input()) in A else "No")

Submission status: Accepted

Solution code:
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()

# int(input())
# map(int, input().split())

n = int(input())

st = {i * j for i in range(1, 10) for j in range(1, 10)}

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

Submission status: Accepted

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

def main():
    N = int(input())
    for i in range(1,10):
        for ii in range(1,10):
            seki = i * ii
            if N == seki:
                print('Yes')
                return
    print('No')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
ret = "No"
for i in range(1,10):
    for j in range(1, 10):
        if i * j == N:
            ret = "Yes"
print(ret)

Submission status: Accepted

Solution code:
N = int(input())
l = []
for i in range(1, 10):
    for j in range(1, 10):
        l.append(i*j)
if N in l:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())

A = set()
for i in range(1, 10):
    for j in range(1, 10):
        A.add(i * j)

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

Submission status: Accepted

Solution code:
import queue

"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""
N = int(input())
s = "No"
for i in range(1,10):
	for j in range(1,10):
		if i*j==N:
			s = "Yes"
print(s)

Submission status: Accepted

Solution code:
n = int(input())

ans = "No"
for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy
from __future__ import division, print_function
from collections import defaultdict, Counter, deque
from future_builtins import ascii, filter, hex, map, oct, zip
from random import randint
from itertools import imap as map, izip as zip, permutations, combinations, combinations_with_replacement
from __builtin__ import xrange as range
from math import ceil
from _continuation import continulet
from cStringIO import StringIO
from io import IOBase
import __pypy__
from bisect import bisect, insort, bisect_left, bisect_right
import sys
import os
import re
sys.setrecursionlimit(9999)
inf = float('inf')
mod = int(1e9) + 7
mod_ = 998244353
N = 5001
 
'''
Check for special cases (n=1)
One wrong submission = 10 mins penalty!
do smth instead of nothing and stay organized
'''

def main():
	n = int(input())
	for i in range(1, int(n**.5)+1):
		if n%i == 0:
			if i <= 9 and n//i <= 9:
				print('Yes')
				return
	print('No')


BUFSIZE = 8192
class FastI(IOBase):
	def __init__(self, file):
		self._fd = file.fileno()
		self._buffer = StringIO()
		self.newlines = 0
 
	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
		self.newlines = 0
		return self.buffer.read()
 
	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count("\n") + (not b)
			ptr = self._buffer.tell()
			self._buffer.seek(0, 2), self._buffer.write(
				b), self._buffer.seek(ptr)
		self.newlines -= 1
		return self._buffer.readline()
class FastO(IOBase):
	def __init__(self, file):
		self._fd = file.fileno()
		self._buffer = __pypy__.builders.StringBuilder()
		self.write = lambda s: self._buffer.append(s)
 
	def flush(self):
		os.write(self._fd, self._buffer.build())
		self._buffer = __pypy__.builders.StringBuilder()
def print(*args, **kwargs):
	sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop("end", "\n"))
	if kwargs.pop("flush", False):
		file.flush()
def gcd(x, y):
	while y:
		x, y = y, x % y
	return x
sys.stdin, sys.stdout = FastI(sys.stdin), FastO(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
if __name__ == "__main__":
	def bootstrap(cont):
		call, arg = cont.switch()
		while True:
			call, arg = cont.switch(to=continulet(
				lambda _, f, args: f(*args), call, arg))
	cont = continulet(bootstrap)
	cont.switch()
	main()

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
  for j in range(1, 10):
    if i * j == N:
      print("Yes")
      exit()
print("No")

Submission status: Accepted

Solution code:
n = int(input())
for i in range(9):
    for j in range(9):
        if (i+1)*(j+1) == n:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())

k = []
for i in range(1, 10):
    for j in range(1, 10):
        k.append(i * j)

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

Submission status: Accepted

Solution code:
n = int(input())


def check():
    for i in range(1, 10):
        for j in range(1, 10):
            if i * j == n:
                return True
    return False


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

Submission status: Accepted

Solution code:
N = int(input())
ans = "No"
for i in range(10):
    for j in range(10):
        if i*j == N:
            ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if N == i*j:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
n = int(input())

kuku = set()

for i in range(1,10):
    for j in range(1,10):
        kuku.add(i*j)
if n in kuku:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
list1 = []
for i in range(1,10):
    for j in range(1,10):
        list1.append(i*j)
if n in list1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1,10):
	for j in range(1,10):
		if i*j == n:
			ans = 1

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

Submission status: Accepted

Solution code:
N=int(input())
f=False
for i in range(1,10):
    if N%i==0 and 1<=N//i<=9:
        f=True
        break
print('Yes' if f else 'No')

Submission status: Accepted

Solution code:
n=int(input())
for i in range(1,10):
    for j in range(1,10):
        if n==i*j:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
n = int(input())

for i in range(1, 10):
    if n % i == 0:
        if 0 < n // i < 10:
            print('Yes')
            exit()

print('No')
exit()

Submission status: Accepted

Solution code:
n =int( input())

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == n:
            print("Yes")
            exit(0)


print("No")

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

N = INT()

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i*j == N:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
N = int(input())
L = []

for i in range(1, 10):
    for j in range(1, 10):
        L.append(i * j)
if N in L:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
n=int(input())
l=[]
for i in range(1,10):
  for j in range(1,10):
    if i*j==n:
      print('Yes')
      sys.exit()
print('No')

Submission status: Accepted

Solution code:
N=int(input())

for i in range(1,10):
    for j in range(1,10):
        if i*j==N:
            print("Yes")
            exit()
print("No")

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n = INT()
flag = False
for i in range(1,10):
    if n%i==0:
        if 1 <= n//i <= 9:
            flag=True

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

Submission status: Accepted

Solution code:
N = int(input())

ans99 = set()

for i in range(1,10):
    for j in range(1, 10):
        ans99.add(i*j)

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

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1, 10):
  if n%i==0 and n//i<=9:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
for i in range(1,10):
    if n%i==0 and n//i<10:
        print("Yes")
        quit()
print("No")

Submission status: Accepted

Solution code:
N = int(input())
for a in range(1, 10):
    c = N%a
    if c != 0:
        continue
    b = N/a

    if 1 <= b <= 9:
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
N = int(input())
for a in range(1,10):
    for b in range(1,10):
        if N == a*b:
            print("Yes")
            exit(0)
print("No")

Submission status: Accepted

Solution code:
n = int(input())
ans = "No"
for i in range(1, 10):
    for j in range(1, 10):
        if n==i*j: ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1, 10):
    for j in range(i, 10):
        if i * j == n:
            print('Yes')
            exit()
print('No')

Submission status: Accepted

Solution code:
n=int(input())
for i in range(1,10):
  if n%i==0 and 0<n//i<10:
    print("Yes")
    exit()
print("No")