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())
ok = False
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == n:
            ok = True
            break
if ok:
    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())

count = 0

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

if count >= 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
prod = ["No"] * 101
for i in range(10):
    for j in range(10):
        prod[i*j] = "Yes"
print(prod[n])

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:
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:
# coding: utf-8
N = int(input())
for i in range(1, 10, 1):
    tmp = N / i
    if 1 <= tmp <= 9 and int(tmp) == tmp:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = str(input())

ans = []
for i in range(1,10):
    for j in range(1,10):
        ans.append(str(i*j))
if n in ans:
    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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())

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


main()

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

Submission status: Accepted

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

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

print('No')

Submission status: Accepted

Solution code:
N =int(input())
t = 0
for i in range(1,10):
    if any([N==j*i for j in range(1,10)]) and t==0:
        print('Yes')
        t=1
if t==0:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
b = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

tmp = list(range(1,10))

for i in range(1,10):
    if n/i in tmp:
        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 and n / i < 10:
        ans = "Yes"
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N=one_int()
flg=False
for i in range(1,10):
    if (N/i).is_integer():
        if 1<= int(N//i) <= 9:
            flg=True
if flg:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n=int(input())
for c in range(1,10):
    for d in range(c,10):
        if c*d==n:
            n="Yes"
if n!="Yes":
    n="No"
print(n)

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())
kuku=[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 N in kuku:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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
import sys
import bisect
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 = II()

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

f = 0

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

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
def main():
    # input
    n = int(input())

    # calc
    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:
n = int(input())
ls = []
for i in range(1, 10):
    for j in range(1, 10):
        ls.append(i*j)

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

Submission status: Accepted

Solution code:
import sys
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

a = int(input())
myset = set()
for i in range(1,10):
    for j in range(1,10):
        myset.add(i*j)
if a in myset:
    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 N in a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())

flag = False
for x in range(1, 10):
    if N % x == 0 and 1 <= N // x <= 9:
        flag = True
        break

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

Submission status: Accepted

Solution code:
N = int(input())
a = False
for i in range(1,10):
    if(N%i==0):
        if(N/i <= 9):
            a = True
if(a):
    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")
            break
    else:
        continue
    break
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

N = int(input())

m = [-1]*101

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

if m[N]==1:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False
input = sys.stdin.readline
N = int(input())
if em: sys.stdin = open('/dev/tty')
for i in range(1,10):
  if N // i < 10 and N % i == 0:
    print("Yes")
    exit()
  else:
    continue
print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
result = False
for i in range(1, 10):
    a = n // i
    b = n % i
    if (a < 10) & (b==0):
        result = True
if result:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))

def solve():
    return


def main():
    n = getN()
    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:
# B
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:
def main():
    N = int(input())
    for i in range(1, 10):
        for j in range(1, 10):
            if i * j == N:
                print("Yes")
                exit()
    print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
i = 1
ans = "No"
while i < 10:
  n = N // i
  if n * i == N and n < 10 and n > 0:
    ans = "Yes"
    break
  i += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')
    return

main()

Submission status: Accepted

Solution code:
n = int(input())
s = set()
for i in range(9):
    for j in range(9):
        s.add((i+1)*(j+1))
if n in s:
    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:
    ans="Yes"
    break
  else:
    ans="No"
print(ans)

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:
n = int(input())
#a_L = list(map(int,input().split()))

for val in range(1,n+1):
    if n % val == 0 and val < 10 and n/val < 10:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
N = int(input())

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

print(test(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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:
# ABC144 B
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

N = ni()

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

def main():
    if N > 81:
        print("No")
        return None

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

main()

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

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

print('No')

Submission status: Accepted

Solution code:
print(" YNeos"[int(input())in[a*b for a in range(10)for b in range(10)]::2])

Submission status: Accepted

Solution code:
N= int(input())

flag=0
for A in range(1,10):
    if N%A==0:
        if N//A<=9:
            flag=1
            break
if flag==1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
ls = list(range(1,10))
n = int(input())
p = 0
for i in range(1,10):
    if (n/i) in ls:
        print("Yes")
        p += 1
        break
        
if p == 0:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())

for a in range(1, 9 + 1):
  b = n // a
  if 1 <= b <= 9 and a * b == n:
    print('Yes')
    exit(0)

print('No')

Submission status: Accepted

Solution code:
n = int(input())
ok = False
for i in range(1, 10):
    m, rest = divmod(n, i)
    if 1 <= m <= 9 and rest == 0:
        print('Yes')
        ok = True
        break
if not ok:
    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')
      break
  else:
    continue
  break
else:
  print('No')

Submission status: Accepted

Solution code:
N = int(input())

num = [i for i in range(1, 10)]

ans = "No"
for n in num:
  if N % n == 0 and N // n <= 9:
    ans = "Yes"
    break
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

nums = []
for i in range(1, 10):
    for j in range(1, 10):
        nums.append(i*j)
if n in nums:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

import itertools


def judge(n):
    for a, b in itertools.product(range(1, 10), repeat=2):
        if a * b == n:
            return True
    else:
        return False


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        a = N // i
        if 1 <= a <= 9:
            print('Yes')
            exit()
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())
kuku = []
for i in range(1,10):
         for j in range(i,10):
                  kuku.append(i*j)
for k in range(len(kuku)):
         if n == kuku[k]:
                  print("Yes")
                  exit()
print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
num=[1,2,3,4,5,6,7,8,9]
for n in num:
  if (N/n) in num:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
n = int(input())

cnt = 0
for i in range(1,10):
    if n % i ==0 and (n/i) < 10:
        cnt += 1
        break
    else:
        pass

if cnt > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import itertools

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
flag = False
n = int(input())
for i in range(9):
    for j in range(9):
        if n == (i+1)*(j+1):
            flag = True

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

Submission status: Accepted

Solution code:
n = int(input())

for i in range(9, 0, -1):
    if n % i == 0:
        n /= i
        break

if n <= 9:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def f(a):
    valid = tuple(range(1, 9 + 1))
    for x in valid:
        if a % x == 0 and a // x in valid:
            return "Yes"
    return "No"

a = int(input())
ans = f(a)
print(ans)

Submission status: Accepted

Solution code:
kuku = set([i * j for i in range(1, 10) for j in range (1, 10)])
def main():
    a = int(input())
    print('Yes' if a in kuku else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

N=int(input())
t=False

ll=[i for i in range(1,10)]

for i in range(1,10):
    if N/i==N//i:
        if N//i in ll:
            t=True
if t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = False
for x in range(1,10):
    if N%x == 0:
        if N//x <= 9:
            ans = True
            break
if ans:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def solve_b(c):
    res = "No"
    for a in range(1, 10):
        if c % a == 0 and c // a < 10:
            res = "Yes"
    return res


def main():
    # input
    c = int(input())
    res = solve_b(c)
    print(res)


def test():
    assert solve_b(10) == "Yes"
    assert solve_b(50) == "No"
    assert solve_b(81) == "Yes"


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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


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


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


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


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


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


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


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


def mt(f):
    import time

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

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

    return wrap


@mt
def slv(N):
    cand = set(a * b for a, b in combinations_with_replacement(range(1, 10), 2))
    if N in cand:
        return 'Yes'
    return 'No'


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

N = int(input())

flag = False
for i in range(1, 10):
    M = N / i
    if M == int(M) and 1 <= M <= 9:
        flag = True
        break

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1,10):
    #割り切れる時
    if N % i == 0:
        x = N/i
        if x >= 1 and x <= 9:
            check = True

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        N = int(input())

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


# Run main
if __name__ == '__main__':
    AtCoder().main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    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__':
    resolve()

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())
flag = 0
for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            flag = 1
print('Yes' if flag == 1 else 'No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


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

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

  print('No')


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
M = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == M:
            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) in (1,2,3,4,5,6,7,8,9):
            return 'Yes'
    else:
        return 'No'

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

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):
    if N%i==0 and N//i<10:
        flag = True
        break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n = readi()

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())
L = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 15, 21, 24, 27, 20, 28, 32, 36,
     15, 25, 30, 35, 40, 45, 36, 42, 48, 54, 49, 56, 63, 64, 72, 81]

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:
		if N // i <= 9:
			print("Yes")
			exit()
print("No")

Submission status: Accepted

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

else:
    print("No")

Submission status: Accepted

Solution code:
import sys


def main():
    n = int(sys.stdin.readline().strip())

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


main()

Submission status: Accepted

Solution code:
n = int(input())

kuku = []

for i in range(9):
    for j in range(9):
        kuku.append((i+1) * (j+1))

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs= sys.stdin.buffer.readlines
#rstrip().decode('utf-8')

#import math
#import numpy as np
#import operator
#from heapq import heapify,heappop,heappush
#from math import gcd
#from fractions import gcd
#from collections import deque
#from collections import defaultdict
#from collections import Counter
#from itertools import accumulate
#from itertools import groupby
#from itertools import permutations
#from itertools import combinations
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import floyd_warshall
#from scipy.sparse.csgraph import csgraph_from_dense
#from scipy.sparse.csgraph import dijkstra
#sys.setrecursionlimit(10**7)

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

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




if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

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

N = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy

# 入力 =stdin.readline().rstrip()
# 分割 = stdin.readline().rstrip().split()

'''
条件に合うものを絞り込む
data = [1, 2, 3]
s = [x for x in data if x % 3 == 0]
'''

'''
文字配列を数値に
l_si = ['-10', '0', '100']

l_si_i = [int(s) for s in l_si]
'''

'''
a = [2, 4, 6, 8]
b = [3, 6, 9]

print(list(set(a) | set(b)))  # 和集合
print(list(set(a) & set(b)))  # 積集合
'''

'''
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
while len([x for x in A if x % 2 == 0]) == N:
    A = list(map(lambda y: y / 2, A))
    count += 1
print(count)
'''

'''
.append(要素)
.extend(要素)
.insert(場所,要素)
del 配列名[場所]
-1で末尾で末尾から一つ前
'''
'''
間に空白追加
' '.join(lis)
'''
'''
copy.copy(配列名)
'''
'''
sort()
sorted(reverse=true)
'''
'''
2分探索
bisect.bisect_left(リスト, 要素)
'''
tes = False
num = int(stdin.readline().rstrip())
for k1 in range(1, 10):
    for k2 in range(1, 10):
        if (num == k1 * k2):
            print('Yes')
            tes = True
            break
    if (tes):
        break
if (not tes):
    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:
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:
n=int(input())
z=0
for i in range(1,10):
    for j in range(1,10):
        if i*j==n:
            z=1
            print('Yes')
            break
    else:
        continue
    break
if z==0:
    print('No')