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

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'
for i in range(9):
    if n % (i+1) == 0:
        if n // (i+1) <= 9:
           ans = 'Yes'


print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
#%%
n = int(input())

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

x = factorization(n)
#print(x)
l = []
for i in range(len(x)):
    for j in range(x[i][1]):
        l.append(x[i][0])
#print(l)

import itertools
c = list(itertools.product(range(2), repeat=len(l)))

flag = False
for i in range(len(c)):
    a = 1
    b = 1
    for j in range(len(c[i])):
        if c[i][j] == 0:
            a *= l[j]
        else:
            b *= l[j]
    if a <= 9 and b <= 9:
        flag = True

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# B - 81
N = int(input())

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

print("No")

Submission status: Accepted

Solution code:
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        a = []
        if n % i == 0:
            a.append(i)
            # divisors.append(i)
            if i != n // i:
                a.append(n//i)
                # divisors.append(n//i)
            else:
                a.append(i)
        divisors.append(a)

    # divisors.sort()
    return divisors

n = int(input())
divisors = make_divisors(n)
flag = 0
for i in divisors:
    if i:
        if 0 < i[0] < 10 and 0 < i[1] < 10:
            flag = 1

if flag:
    print('Yes')
else:
    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:
N = int(input())
able = False

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            able = True
            break

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

Submission status: Accepted

Solution code:
import math

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:



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

x=int(input())
if x in r:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if A==0:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
A = [1,2,3,4,5,6,7,8,9]
cnt = 0
for i in range(1,10):
    if N/i in A:
        cnt+=1
if cnt==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = ("No")
for i in range(9):
    for k in range(9):
        if n / (i+1) == k + 1:
            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:
A = int(input())
Y = 0
for i in range(9):
	for j in range(9):
		if A == (i+1)*(j+1):
			Y = 1

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

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n = [int(e) for e in lines[0].split(" ")][0]

    return (n, )


def solve(n):

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

    return  result


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

flag = False

for i in range(2, 10):
    if n % i == 0 and n / i < 10:
        flag = True
        break

if n == 1:
    flag = True

print("Yes" if flag 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'
print(ans)

Submission status: Accepted

Solution code:
A= input()
A= int(A)

count = 0
for i in [1,2,3,4,5,6,7,8,9]:
  for j in [1,2,3,4,5,6,7,8,9]:
    if i * j == A:
      count += 1

if count ==0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

b = False
for i in range(1, 10):
    if a % i == 0:
        if a // i < 10:
            b = True
print("Yes" if b else "No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
n = int(input())
A = [1]
for i in range(1,10):
    if n%i == 0 and 1<n//i<=9:
        A.append(i)
        
b = max(A)

if n//b <10:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding:utf-8 -*-
#
# Author:   bebebe
# Created:  2019-10-27
#


N = int(input().strip())

result = 'No'
for a in range(1, 10):
    if N % a == 0:
        b = N / a
        if b > 0 and b < 10:
            result = 'Yes'
            break

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
	#A, B = [int(x) for x in input().split()]
	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")

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n=int(input())
    l=[]
    for i in range(1,10):
        for j in range(1,10):
            l.append(i*j)
    if n in set(l):
        print('Yes')
    else:
        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(i*j==N):
            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 <= 9:
         print('Yes')

         exit()

else:
   print('No')

Submission status: Accepted

Solution code:
N = int(input())

result = 'No'

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

print(result)

Submission status: Accepted

Solution code:
x = int(input())

result =  'No'

for i in range(9):
    c = i + 1
    if x % c == 0 and x // c <= 9:
        result =  'Yes'

print(result)

Submission status: Accepted

Solution code:
def run(N):
    ret = 'No'
    for i in range(1, 10):
        if N % i == 0 and N / i <= 9:
            ret = 'Yes'
    return ret


def main():
    N = int(input())
    print(run(N))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
def judge(x):
    if 1<= x <= 9:
        return True
    else:
        return False
ans = 0
for i in range(1,10):
    if N % i == 0 and judge(N / i):
        ans += 1
        break
    else:
        continue
if ans == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

is_valid = False
for i in range(1, 10):
    if N % i == 0:
        d = N // i
        if 0 < d and d < 10:
            is_valid = True
            break

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

Submission status: Accepted

Solution code:
N = int(input())

flag = "No"
for p in [9, 8, 7, 6, 5, 4, 3, 2, 1]:
    if N % p == 0 and N / p < 10:
        flag = "Yes"
        break

print(flag)

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

Submission status: Accepted

Solution code:
N=int(input())
Ans='No'
A=[0 for _ in range(81)]
count = 0
for i in range(9) :
    for j in range(9) :
        A[count]=(i+1)*(j+1)
        count+=1

for i in range(81) :
    if (A[i]==N) : Ans='Yes'

print(Ans)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n = ni()
for i in range(1,10):
    x = n//i
    if x*i == n and x <= 9 and x >= 1:
        print("Yes")
        sys.exit(0)
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:
#!/usr/bin/env python3


def solve(N):
    YES = 1
    NO = 0
    if N <= 9:
        return YES
    for a in range(1, 10):
        b = N // a
        if b * a != N:
            continue
        if b > 9:
            continue
        return YES
    return NO


if __name__ == '__main__':
    N = int(input())

    ans = solve(N)

    print(['No', 'Yes'][ans])

Submission status: Accepted

Solution code:
import sys
from pprint import pprint

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

if __name__ == '__main__':
    n = int(sys.stdin.readline().strip())
    solve(n)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    N = int(inputs[0])
    if N == 1:
        return "Yes"
    if N > 81:
        return "No"
    for i in range(2, 10):
        if N % i == 0:
            for j in range(1, 10):
                if i * j == N:
                    return "Yes"
    return "No"


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

Solution code:
N = int(input())

judge = 'No'
for i in range(1,10):
    for j in range(1,10):
        if i*j == N:
            judge = 'Yes'
            break;

    if judge == 'Yes':
        break;

print(judge)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
def lmfi(): return list(map(float, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()
# template


def main():
    N = ii()
    for i in range(1, 10):
        if N % i != 0:
            continue
        else:
            if N // i <= 9:
                print("Yes")
                return
    print('No')
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

n = int(input())

for i in range(1, 10):
	if n / i == int(n / i) and n / i <= 9:
		print('Yes')
		sys.exit()

print('No')

Submission status: Accepted

Solution code:
import sys
n = int(sys.stdin.readline())
flag = False
for i in range(1,10):
    for j in range(1, 10):
        if (i*j==n):
            flag = True
            break

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

Submission status: Accepted

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

    print('No')

  

if __name__ == "__main__":
    main()

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(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(1,10):
    if n%i==0 and n/i<=9:
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
N = int(input())

for n1 in range(1,9+1):
	for n2 in range(1,9+1):
		if n1*n2 == 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 == 0:
        if N / i <= 9:
            ans = "Yes"

print(ans)

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

ls_set = set(sum([[i * j for i in range(1, 10)] for j in range(1, 10)], []))

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

Submission status: Accepted

Solution code:
N = int(input())
b = 0
for i in range(1,10):
    a = N/i
    for j in range(1,10):
        if j == a:
            b = 1
if b == 1:
    print('Yes')
else:
    print('No')

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

print("No")

Submission status: Accepted

Solution code:
n = int(input())

a_list = []
for i in range(1,10):
    for j in range(1, 10):
        a_list += [i*j]

a_list = set(a_list)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import bisect
import sys
input = sys.stdin.readline

setrecursionlimit(1000000)

dp = defaultdict(lambda x:-1)

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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Accepted

Solution code:
def calc(N):
    l = set()
    for i in range(1, 10):
        for j in range(1, 10):
            l.add(i * j)
    if N in l:
        return "Yes"
    else:
        return "No"


N = int(input())

print(calc(N))

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)

set_L = set(L)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

f = False
for i in range(1, 10):
    r = n / i
    if float(r).is_integer() and r < 10:
        f = True

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

Submission status: Accepted

Solution code:
n = int(input())

end_loop = False
for i in range(1, 10):
	for j in range(1, 10):
		if i*j == n:
			print('Yes')
			end_loop = True
			break
	if end_loop:
		break
if not end_loop:
	print('No')

Submission status: Accepted

Solution code:
N = int(input().strip())

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

Submission status: Accepted

Solution code:
a=int(input())
i=1
j=1
flag=0
for i in range(10):
    for j in range(10):
        if i*j == a:
            # print('Yes')
            flag=1
if flag==0:
    print('No')
else:
    print('Yes')

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)
ans = 'No'
if n in l:
    ans = 'Yes'
print(ans)

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:
def b():
    n = int(input())

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

    print("No")

if __name__ == '__main__':
    b()

Submission status: Accepted

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

for i in range(9):
    for j in range(9):
        if (i + 1) * (j + 1) == n:
            m = 1
            break

if m == 0:
    print("No")
else:
    print("Yes")

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

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

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

Submission status: Accepted

Solution code:
N = int(input())

import numpy as np
table = np.arange(1, 10).reshape(-1, 1) * np.arange(1, 10).reshape(1, -1)

print('Yes' if np.any(table==N) else 'No')

Submission status: Accepted

Solution code:
def solve():
    n = int(input())
    if n > 81:
        print('No')
        return
    for i in range(1, 10):
        (q, mod) = divmod(n, i)
        if n % i == 0 and q <= 9:
            print('Yes')
            return
    print('No')
    return

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    flag = False
    for i in range(1,10):
        for j in range(1,10):
            if i*j == n:
                flag = True
    if flag:
        print("Yes")
    else:
        print("No")    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())

count = 0
for i in range(1, 10):
    for j in range(1, 10):
        if n == i * j:
            count += 1
if count == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
n = int(input())

f = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

try:
	c = res.index(n)
	print("Yes")
except:
	print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ans = 'No'
for i in range(1, 10):
    q, mod = divmod(N, i)
    if q <= 9 and mod == 0:
        ans = 'Yes'
        break
print(ans)

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

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):
    a = n/i
    if a < 10 and a==n//i:
        print("Yes")
        exit(0)
print("No")

Submission status: Accepted

Solution code:
n = int(input())

# 割り切れたら1
flag  = 0

for i in range(1, 10) :
    if n % i == 0 and n // i < 10 :
        flag = 1

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())

ans = 0
for i in range(1, 10):
    for h in range(1, 10):
        if N == i * h:
            ans += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

for i in range(1, 10):
    d, m = divmod(n, i)
    if m == 0:
        if 1 <= d <= 9:
            print("Yes")
            quit()
print("No")

Submission status: Accepted

Solution code:
n = int(input())
a = [1,2,3,4,5,6,7,8,9]
ans = []
for i in range(9):
    for j in range(9):
        ans.append(a[i]*a[j])
if n in ans:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#
# abc144 b
#
import unittest
from io import StringIO
import sys


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


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

    for i in range(1, 10):
        for j in range(1, 10):
            if i*j == N:
                print("Yes")
                exit()
    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 = """10"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """50"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """81"""
        output = """Yes"""
        self.assertIO(input, output)


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

Submission status: Accepted

Solution code:
import sys
N = int(input())
for i in range(1,10):
    if N%i==0:
        rem = N/i
        if(1<=rem and rem<=9):
            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

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

Submission status: Accepted

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

N = int(input().split()[0])
is_ok = False
for x in range(1, 10):
    if N % x == 0:
        if 1 <= N // x <= 9:
            is_ok = True
            break

ans = "Yes" if is_ok else "No"
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main(n):
    list1 = range(1, 10)
    list2 = range(1, 10)
    qq = set()
    for a in list1:
        for b in list2:
            qq.add(a * b)
    if n in qq:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    N = int(input())
    print(main(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:
def read():
    N = int(input().strip())
    return N, 

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

if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

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