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:
#!/usr/bin/env python3
import sys

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


def solve(N: int):
    for i in range(1, 10):
        m = N // i
        d = N % i
        if d == 0 and 1 <= m <= 9:
            print(YES)
            return
    print(NO)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
d = set()
for i in range(1,10):
    for j in range(1,10):
        d.add(i*j)

n = int(input())
if n in d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
l = []

for x in range(1, 10):
    for y in range(1, 10):
        l.append(x * y)

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

Submission status: Accepted

Solution code:

from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N = inp()

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

print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = 10**9

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=set()
for i in range(1,10):
    for j in range(1,10):
        s.add(i*j)
n=int(input())
if(n in s):
    print('Yes')
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:
            flg = True
            break

print('Yes' if flg else 'No')

Submission status: Accepted

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

# input
N = int(input())

# solve
ans = False
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            ans = True
            break

# output
print('Yes' if ans else '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:
            print("Yes")
            f = 1
            break
    if f: break
else:
    print("No")

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

# main()
print(main())

Submission status: Accepted

Solution code:
N=int(input())

f=False

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ok = False
for n in range(1, 10):
    if N%n == 0 and N//n < 10:
        ok = True

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

Submission status: Accepted

Solution code:
klist=[]

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

n=int(input())
if n in klist:
    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")
        exit()

print("No")

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())

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

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

print(output)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n = ni()

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

print("Yes" if n in ok_set 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 i*j==n:
            flg=True
print('Yes' if flg else 'No')

Submission status: Accepted

Solution code:
N = int(input())

l = []
for a in range(1,10):
    for b in range(1,10):
        l.append(a*b)

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)

def main():
  n = ni()

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

main()

Submission status: Accepted

Solution code:
N, = (int(x) for x in input().split())

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 = False
for i in range(1, 10):
    if(N % i == 0):
        a = N // i
        if(1 <= a and a <= 9):
            flag = True
if(flag):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
# from bisect import *
# from collections import *
# from heapq import *
# import itertools
# import math
# INF = 10**9
# MOD = 10**9+7

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

N = int(input())

for i in range(9):
    i += 1

    for j in range(9):
        j += 1

        if i * j == N:
            print ("Yes")
            sys.exit()

print ("No")

Submission status: Accepted

Solution code:
n = int(input())
# x,y = map(int,input().split())
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())
lst = []
for i in range(1,10):
    for j in range(1,10):
        if i*j not in lst:
            lst.append(i*j)
if n in lst:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

for i in range(1, 10):
  a = N // i
  if a * i == N and a >= 1 and a <= 9:
    print("Yes")
    exit()

print("No")

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf8
from collections import  Counter

n=int(input())

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

print("No")

Submission status: Accepted

Solution code:
N = int(input())

for a in range(1,10):
    if N%a==0 and 1<=(N//a)<=9:
        print("Yes")
        break
else:
    print("No")

Submission status: Accepted

Solution code:
N=int(input())

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

if N in ALL:
    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")
            quit()
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())
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:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    s=set()
    for i in range(1,10):
        for j in range(1,10):
            s.add(i*j)
    n=int(input())
    print("Yes" if n in s else "No")
resolve()

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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

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

Submission status: Accepted

Solution code:
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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

    for i in range(1, 101):
        if N % i == 0:
            M = N // i
            if 1 <= M <= 9 and 1 <= i <= 9:
                print('Yes')
                return
    print('No')


sol()

Submission status: Accepted

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

print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

N = I()
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())

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

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# 
# a, b = list(map(int, input().split()))
# s = input()

ans = "No"

n = int(input())
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:
import sys

sys.setrecursionlimit(10 ** 6)

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

main()

Submission status: Accepted

Solution code:
from fractions import gcd
from datetime import date, timedelta
from heapq import*
import math
from collections import defaultdict, Counter, deque
import sys
from bisect import *
import itertools
import copy
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7


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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(N: int):

    ans = []
    for i in range(1, 10):
        for j in range(1, 10):
            ans.append(i*j)
    if N in ans:
        yes()
    else:
        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())
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:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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

#Solve
if __name__ == "__main__":
    solve()

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:
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:
#!/usr/bin/env python

from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

m = set(i * j for i in range(1, 10) for j in range(1, 10))
if input() in m:
    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"
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

for x in (range(1,10)):
    for y in (range(1,10)):
        if x * y == n:
            flag = True
    else:
        continue
    break
    

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
divisor = [ __ for __ in range(1, 10)]
N = int(input())
for i in range(1, 10):
    if N / i in divisor:
        X = N / i
    if X in divisor:
        print("Yes")
        break

print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

for x in range(1, 9 + 1):
    for y in range(1, 9 + 1):
        if x * y == n:
            a = True

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

Submission status: Runtime Error

Solution code:
a = int(input())
if a % 1 == 0 or if a % 2 == 0 or if a % 3 == 0 or if a % 4 == 0 or if a % 5 == 0 or if a % 6 == 0 or if a % 7 == 0 or if a % 8 == 0 or if a % 9 == 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a = int(input())
if a % 1 == 0 or if a % 2 == 0 or if a % 3 == 0 or if a % 4 == 0 or if a % 5 == 0 or if a % 6 == 0 or if a % 7 == 0 or if a % 8 == 0 or if a % 9 == 0 or

Submission status: Runtime Error

Solution code:
product = []

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

if N in product:
    result = 'Yes'
else:
    result = 'No'

print(result)

Submission status: Runtime Error

Solution code:
A,B = map(int, input().split())
if A <= 9 and B <= 9:
    print(A * B)
else:
    print(-1)

Submission status: Runtime Error

Solution code:
N = int(input())

if N > 81 or N == 0:
    print("No")
    exit()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
for i in range(9):
    for j in range(9):
        k = i*j
        if n%k==0:
            print('Yes')
            exit()
        else:
            continue
print('No')

Submission status: Runtime Error

Solution code:

n=int(input())
for i in range(9):
    for j in range(9):
        if n%(i*j)==0:
            print('Yes')
        else:
            print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=0
for i in range(9):
  for k in range(9):
    if (i+1)*(k+1)==a:
      print("Yes")
      break
      b=b+1
if b=81:
  print("No")

Submission status: Runtime Error

Solution code:
import sympy
S = int(input("入力："))

divisors = sympy.divisors(S)
#print(divisors)
n = len(divisors)

for i in range(int(n / 2+n % 2)):
    #print(divisors[i])
    if S // divisors[i] <= 9:
        result ="Yes"
    else:
        result ="No"
print(result)

Submission status: Runtime Error

Solution code:
import sympy
S = int(input())

divisors = sympy.divisors(S)
#print(divisors)
n = len(divisors)
for i in range(n):
    if S // divisors[i-1] <=9:
        result ="Yes"
    else:
        result ="No"
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Solution code:
a,b,c,x = [int(input()) for _ in range(4)]
print(sum(500*i+100*j+50*k==x for i in range(a+1)for j in range(b+1)for k in range(c+1)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
if n%2 == 0:
    cnt = 0
    for i in range(n//2):
        if s[i] == s[i + n//2]:
            cnt += 1
            if cnt == n//2:
                print("Yes")
                break
        else:
            print("No")  
            break
else:
    print("No")

Submission status: Runtime Error

Solution code:
N = int(input())

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: Runtime Error

Solution code:
N = int(input())

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

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

Submission status: Runtime Error

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

print('Yes' if N in kuku else 'No')

Submission status: Runtime Error

Solution code:
a, b = list(map(int, input().split()))
if a >= 10 or b >= 10:
    print('-1')
else:
    print(a*b)

Submission status: Runtime Error

Solution code:
n = int(input())
i = 1
while i * i <= n:
  if n % i != 0:
    continue
  j = n // i
  if i < 10 and j < 10:
    print("Yes")
	quit()
print("No")

Submission status: Runtime Error

Solution code:
a,b = input().split()

a=int(a)
b=int(b)

if a>=1 and a<=9 and b>=1 and b<=9:
    print(a*b)
else: print("-1")

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if a<10 and b<10:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = set(filter(lambda x : n % x == 0 and n / x < 10, [x for x in range(1, 10)])

print("Yes" if len(s) == 0 in s else "No")

Submission status: Runtime Error

Solution code:
n = int(input())

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

print('No')

Submission status: Runtime Error

Solution code:
n = int(input())

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

print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
kuku = []
for i in range(1, 10):
  kuku += [i * e for i in range(1, 10)]
if N in kuku:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N=int(input())

for i in range(1,10):
  for k in range(1,10):
    N==i*k
    print('Yes')
    
    else:
      
      for i in range(11,100):
      for k in range(11,100):
      N==i*k
      print('No')

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
array = [ I for I in range(1,10) ]

if not ( 1 <= N <= 100 ): sys.exit()

for J in range(1,10):
    for K in range(1,10):
        if n == J*K:
            print('Yes')
            sys.exit()
print('No')

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
array = [ I for I in range(1,10) ]

if not ( 1 <= N <= 100 ): sys.exit()

for J in range(1,10):
    for K in range(1,10):
        if n == J*K:
            print('Yes')
print('No')

Submission status: Runtime Error

Solution code:
Suji=[]
for i in range(1,9):
  Suji.append(i)
N = int(input())
Suji_check=False
for s in Suji:
  A = N%s
  try A != 0:
      for t in Suji:
      if A == t:
        Suji_check = True
  except:
    pass
if Suji_check:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
Suji=[]
for i in range(1:9):
  Suji.append(i)
N = int(input())
Suji_check=False
for s in Suji:
  A = N%s
  try A != 0:
      for t in Suji:
      if A == t:
        Suji_check = True
  except:
    pass
if Suji_check:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
Suji=[]
for i in range(1:9):
  Suji.append(i)
N = int(input())
Suji_check=False
for s in Suji:
  A = N%s
  for t in Suji:
    if A == t:
      Suji_check = True
if Suji_check:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.lang.*;
import java.io.*;

public class Main{
    public static void main(String[] args) throws IOException{
        FastReader in = new FastReader();
        FastWriter out = new FastWriter();
        int a;
        a = in.nextInt();
        boolean good = false;
        for (int i = 1; i <= 9; i++){
            for (int j = 1; j <= 9; j++){
                if (i*j==a) good = true;
            }
        }
        out.pl(good ? "Yes" : "No");

        out.close();
    }

}
class FastReader{ 
    BufferedReader br; 
    StringTokenizer st; 
    public FastReader() { 
        br = new BufferedReader(new InputStreamReader(System.in)); 
    } 
    String next(){ 
        while (st == null || !st.hasMoreElements()) { 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            }catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } 
        return st.nextToken(); 
    } 
    int nextInt(){ 
        return Integer.parseInt(next()); 
    } 
    long nextLong(){ 
        return Long.parseLong(next()); 
    } 
    double nextDouble(){ 
      return Double.parseDouble(next()); 
    } 
    String nextLine(){ 
        String str = ""; 
        try{ 
            str = br.readLine(); 
        } 
        catch (IOException e){ 
            e.printStackTrace(); 
        } 
        return str; 
    } 
}
class FastWriter{
    PrintWriter out;
    FastWriter(){
        out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
	out.flush();
    }
    void pl(Object o){
        out.write(o.toString());
	    out.write("\n");
        out.flush();
    }
    void pl(){
        out.write("\n");
    }
    void p(Object o){
        out.write(o.toString());
    }
    void close(){
        out.flush();
        out.close();
    }  
}