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:
# coding: utf-8


def main():
    n = int(input())
    count = 0
    
    for i in range(1, 10):
        syo, amari = divmod(n, i)
        if syo <= 9 and amari == 0:
            print('Yes')
            break
            
        else:
            count += 1
            
    if count == 9:
        print('No')
    
    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())


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


if is_OK(N):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1,10):
    for j in range(i,10):
        if n == i*j:
            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(0)

print("No")

Submission status: Accepted

Solution code:
# coding: utf-8


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

    for i in range(1, 10):
        div, mod = divmod(n, i)
        if 1 <= div <= 9 and mod == 0:
            print('Yes')
            return 0
    print('No')
    
    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from functools import reduce

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

n = int(input())
factor = [1] + prime_factorize(n)

if len(factor) < 2:
    print('Yes')
else:
    for i in range(1,len(factor)):
        a = reduce(lambda x,y:x*y, factor[:i])
        b = reduce(lambda x,y:x*y, factor[i:])
        if 1 <= a <= 9 and 1 <= b <= 9:
            print('Yes')
            break
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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


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")
            break
    else:
        continue
    break
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
kuku = []
for i in range(1, 10):
	for j in range(1, 10):
		kuku.append(i * j)

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

Submission status: Accepted

Solution code:
n = int(input())
mylist = []

for i in range(1, 10):
    for j in range(i ,10):
        mylist.append(i * j)

mylist = set(mylist)

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

Submission status: Accepted

Solution code:
# 81

# libraries
from itertools import combinations

# input
N = int(input())

# solve
l = list(range(1,10))
if N in [i*j for i, j in combinations(l+l, 2)]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def ints():
  return [int(x) for x in input().split()]
def ii():
  return int(input())

memo = {}

for i in range(1, 10):
  for j in range(i, 10):
    memo[i*j] = True

n = ii()
if n in memo:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N = int(input())
for a in range(1, 10):
	if N % a == 0 and N // a < 10:
		print('Yes')
		exit(0)
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())
res = "No"
for i in range(1, 10):
    for j in range(1, 10):
        if i*j == n:
            res = "Yes"
print(res)

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(0)
print("No")

Submission status: Accepted

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

  for i in range(1, 10):
    if N%i == 0:
      if N//i < 10:
        print("Yes")
        return 0
  else:
    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 i * j == n:
            flag = True
            break
    if flag:
        break

print("Yes") if flag else 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 n == i * j:
            print("Yes")
            flg = True
            break
    else:
        continue
    break
if not flg:
    print("No")

Submission status: Accepted

Solution code:
from itertools import product as prod
avail_numbers = [(i + 1) * (j + 1) for i, j in prod(range(9), range(9))]

if int(input()) in avail_numbers:
  print("Yes")
else:
  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)
            break
    if ans=="Yes":
        break
if ans=="No":
    print(ans)

Submission status: Accepted

Solution code:
import itertools

T = [1,2,3,4,5,6,7,8,9]
L = list(itertools.product(T, repeat=2))
S = []
for i in range(len(L)):
    S.append(L[i][0]*L[i][1])
    
n = int(input())
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()
print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())

kk = [i*j for i in range(1,10) for j in range(1,10)]

ans = "No"

if A in kk:
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
import itertools


def read():
    N = int(input())

    return N,


def solve(N, ):
    for i in range(9):
        a = i + 1
        for j in range(9):
            b = j + 1
            if a*b==N:
                return "Yes"
            else:
                continue
    return "No"


            # for i in range(9):
            #     a = i + 1
            #
            #     b = N / a
            #
            #     if b == :
            #         continue
            #     if a * b == N:
            #         return "Yes"
            #     else:
            #         return "No"


if __name__ == '__main__':
    input = read()
    print(solve(*input))

Submission status: Accepted

Solution code:
N = int(input())
ans = False
for i in range(1, 10):
    d = N // i
    if d <= 9 and N == i * d:
        ans = True

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# input
b = int(input())
a = []
for i in range(9):
    for j in range(9):
        a.append((i+1)*(j+1))

if b in set(a):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())

multi = []

for i in range(1, 10):
    for j in range(1, 10):
        multi.append(i * j)

if N in multi:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
exist = False

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
n = int(input())

a = list(itertools.product(range(1, 10), repeat=2))
b = list(map(lambda x: x[0] * x[1], a))

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
sys.setrecursionlimit(200000)
input = sys.stdin.readline

N, = map(int, input().split())
# gx, gy, = map(int, input().split())
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
# S = input().strip()

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 solve():
    N = int(input())

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

    print("No")
    
solve()

Submission status: Accepted

Solution code:
N = int(input())
exist = False

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

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

Submission status: Accepted

Solution code:
N = int(input())
A = list(range(1, 10))
B = [a for a in A if N % a == 0]
C = [b for b in B if N / b < 10]
if len(C) != 0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n = int(input())
ans = 0

for i in range(10):
  for j in range(10):
    if i*j == n:
      ans += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

flag = True

for i in range(1,10):
    for j in range(1,10):
        #print(i, j)
        if i * j == N:
            print("Yes")
            flag = False
    if not(flag):
        break

if flag:
    print("No")

Submission status: Accepted

Solution code:
def main():
	# n,m = map(int,input().split())
	n = int(input())
	# s = str(input())
	# a = list(map(int,input().split()))
	# l = [list(map(int, input().split())) for _ in range(n)]
	ans = 0
	for i in range(1,10):
		if n / i == int(n/i) and int(n/i) < 10:
			# print("i = {}".format(i))
			# print(n//i)
			# print(int(n//i))
			ans = 1
	if ans == 1:
		print("Yes")
	else:
		print("No")
	


if __name__ == '__main__':
	main()

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
        else:
            pass
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

def solve(N: int):
    for i in range(1,10):
        for j in range(1,10):
            if i*j == N:
                print(YES)
                exit()

    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())
out=["No","Yes"]
flg=0

for i in range(1,10):
    if N%i==0 and N//i<=9:
        flg=1
        break

print(out[flg])

Submission status: Accepted

Solution code:
n = int(input())

l1 = []
for i in range(9):
  for j in range(9):
    l1.append((i +1) * (j + 1))

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

Submission status: Accepted

Solution code:
n = int(input())
c = 0
for i in range(9):
  q, mod = divmod(n, i + 1)
  if q < 10 and mod == 0:
    print("Yes")
    c += 1
    break
if c == 0:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())
key = 0
for i in range(9):
    for l in range(9 - i):
        if(num == (i + 1) * (l + i + 1)):
            key = 1
            break
if(key == 1):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()
N = int(N)
xs = []
xs.append(1)
xs.append(2)
xs.append(3)
xs.append(4)
xs.append(5)
xs.append(6)
xs.append(7)
xs.append(8)
xs.append(9)

for i in range(len(xs)):
  if N % xs[i] == 0:
    a = N // xs[i]
    if a >= 1 and a <= 9:
      result = "Yes"
      break
    else:
      result = "No"
  else:
    result = "No"

print(result)

Submission status: Accepted

Solution code:
N=int(input())
 
if N>81:
  print('No')
else:
  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())
list=[]
for i in range(1,10):
  for j in range(1,10):
    list.append(i*j)
if N in list:
   print("Yes")
else:
   print("No")

Submission status: Accepted

Solution code:
n = int(input())
ans = 0

for s in range(1,10):
    for t in range(1,10):
        if n == s*t:
            ans += 1
    
if ans == 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
n = int(input())

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

print(in_kuku(n))

Submission status: Accepted

Solution code:
n = int(input())

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

if(yes):
    print('Yes')
else:
    print('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')
        exit()
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 solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    d = {i * j for i in range(1, 10) for j in range(1, 10)}
    n = int(input().rstrip('\n'))
    print("Yes" if n in d else "No")


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

print("No")

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
arr = np.arange(1, 10)
arr2 = arr[:, np.newaxis] * arr

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

N = int(input())

for i in range(1, 10):
  if N % i == 0 and N // i < 10:
    print("Yes")
    sys.exit()
    
print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
if(a > 81 or a==0):
    print("No")
elif(0<a<10):
    print("Yes")
else:
    for i in range(9, 0, -1):
        if(a%i==0):
            a = a//i
            break
    if(a>9):
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
n = int(input().strip())
ans = False
for i in range(1, 10, 1):
    for j in range(1, 10, 1):
        if (n == i * j):
            ans = True
            break
    if ans:
        print("Yes")
        break
if not ans:
    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
    elif i < 9:
        continue
    else:
        print("No")

Submission status: Accepted

Solution code:
x = int(input())
for i in range(1,10):
    for j in range(1,10):
        if x == i * j:
            print ('Yes')
            exit(0)
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())

ans = "No"
for i in range(1, 10):
    if n == i:
        ans = "Yes"
        break
    if i != 1 and n % i == 0 and n / i < 10:
        ans = "Yes"
        break
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

c = 0

for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            c += 1

if c != 0:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
n=int(input())
s=[]
for i in range(1,10):
  for j in range(1,10):
    s.append(i*j)

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

flg = False
for i in range(1,10):
  for j in range(1,10):
    if N == i * j:
      flg = True
      break
      
print('Yes' if flg else '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:
n = int(input())

for i in range(9):

     if n%(i+1) == 0 and n//(i+1) < 10:
         print('Yes')
         break

else:
    print('No')

Submission status: Accepted

Solution code:
cucu = []
for i in range(1,10):
    for j in range(1,10):
        cucu.append(i*j)
if int(input()) in cucu:
    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<10:
        print("Yes")
        break
    if i == 9:
        print("No")

Submission status: Accepted

Solution code:
import math
if __name__=='__main__':
    flag=0
    n=int(input())
    for i in range((int(math.sqrt(n)))):
        if n%(i+1)==0:
            if len(str(i+1))==1 and len(str(n//(i+1)))==1:
                flag=1
                break
    if flag==1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n = int(input())

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

print(valid(n))

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())
A = [1,2,3,4,5,6,7,8,9]
for i in A:
  if N%i==0 and int(N/i) in A:
    print('Yes')
    exit()
print('No')

Submission status: Accepted

Solution code:
N = int(input())
a = 0

for i in range(9):
    if N % (i+1) == 0:
        a = N /(i+1)
        if len(str(int(a))) == 1:
                print("Yes")
                break
    elif (i) == 8:
        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 i*j == N:
			
			ans = 'Yes'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

for i in range(1, 10):
    d, m = divmod(N, i)

    if d > 9:
        continue

    if not m:
        print('Yes')
        break
else:
    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:
num = int(input())
ans = "No"
for i in range(1,10):
    if num % i == 0 and num//i < 10:
        ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
num=int(input())

YesFlg=0
NoFlag=0
for i in range(1,10):
    a,b=divmod(num, i)
    
    if b==0 and a<10:
        YesFlg=1
   

if YesFlg!=1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
for i in range(1,10):
  if n%i==0 and n/i<=9:
    print('Yes')
    break
else:
  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')
        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())

for i in range(1, 10):
  if n % i ==0:
    if n/i < 10:
      print('Yes')
      break
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:
n = int(input())

flag = False

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


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

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'
            break;
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
list9 = []
for i in range(1,10):
    for j in range(i, 10):
        list9.append(i*j)
try:
    list9.index(N)
    print('Yes')
except ValueError:
    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())
rlst = 'No'
for i in range(1, 10):
    if N%i==0:
        min_ = int(N/i)
        if min_ > 9:
            continue
        for j in range(min_, 10):
            if min_%j == 0:
                rlst = 'Yes'
                break;
print(rlst)

Submission status: Accepted

Solution code:
N = int(input())
c = 0

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            c = 1

if c == 1:
    print('Yes')
else:
    print('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')
    exit()
    
print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
for m in range(1,10):
    for n in range(1,10):
        if N == m*n:
            print("Yes")
            break
    else:
        continue
    break
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())

list = [1,2,3,4,5,6,7,8,9,
2,4,6,8,10,12,14,16,18,
3,6,9,12,15,18,21,24,27,
4,8,12,16,20,24,28,32,36,
5,10,15,20,25,30,35,40,45,
6,12,18,24,30,36,42,48,54,
7,14,21,28,35,42,49,56,63,
8,16,24,32,40,48,56,64,72,
9,18,27,36,45,54,63,72,81]

if list.count(n) > 0:
  print('Yes')
else:
  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:
X=list(range(1,10))
Y={i*j for i in X for j in X}
if int(input()) in Y:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    for a in range(1,10):
        q,r=divmod(n,a)
        if(r==0 and 1<=q<=9):
            print("Yes")
            return
    print("No")
resolve()

Submission status: Accepted

Solution code:
from sys import stdin

a = int(stdin.readline().rstrip())


num = list(range(1,10))

for i in num[::-1]:
    if a/int(i) > 10:
        print('No')
        break
    else:
        if a%int(i)==0 and a//int(i) < 10:
            print('Yes')
            break
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())
if n in {a * b for a in range(1, 10) for b in range(1, 10)}:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n = int(input())

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

        if a == 9 and b == 9:
            print("No")

Submission status: Accepted

Solution code:
n=int(input())
if n>81:
    print('No')
else:
    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())
ans = ('No')
for i in range(1,10):
    for j in range(1,10):
        if i * j == n:
            ans = ('Yes')
            break
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
ans = 'No'

S = set()
for i in range(9):
    for j in range(9):
        S.add((i+1)*(j+1))

if N in S:
    ans = 'Yes'

print(ans)

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')
            break
print(ans)

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())
l=[]
for i in range(1,10):
  for j in range(i,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 = 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())

cand = set([i * j for i in range(1,10) for j in range(1, 10)])
if N in cand:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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


for i in range(10):
    for j in range(10):
        if(N == i*j):
         flag = 1
         break
            
if(flag==1):
    print("Yes")
else:
     print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = set()
for i in range(1,10):
  for j in range(1,10):
    A.add(i*j)
print(['No','Yes'][int(input()) in A])

Submission status: Accepted

Solution code:
kuku= [1, 2, 3, 4, 5, 6, 7, 8, 9]
m=[]
for a in kuku:
    for b in kuku:
        x=a*b
        m.append(x)
if int(input()) in m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = "No"

for i in range(9):
    for j in range(9):
        if (i + 1) * (j + 1) == N:
            ans = "Yes"
            break
    else:
        continue
    break

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

res = 'No'
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            res = 'Yes'
            break
    else:
        continue
    break

print(res)

Submission status: Accepted

Solution code:
n=float(input())
ans = 'No'
for a in range(1,10):
    b = n/a
    if float.is_integer(b) and b<10:
        ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
lst=[x*y for x in range(1,10) for y in range(1,10)]
if int(input()) in lst:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
integer = [list(map(int, s.split())) for s in open(0)][0][0]
dlist = [divmod(integer, i) for i in range(1, 10)]
found = 0
for d in dlist:
    if d[0] <= 9 and d[1] ==0:
        print("Yes")
        found += 1
        break 
if found == 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 i*j == n:
      ans ="Yes"
      
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

s = set()
for i in range(10):
    for k in range(10):
        s.add(i*k)

if n in s:
    print("Yes")
else:
    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')