Problem: 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`.

Submission attempts (in order):
N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif (N==10 or N == 30 or N == 50 or N == 70 or N == 80 or isPrime(N)):
  print("No")
else:
  i = 2
  while(i<10):
    if N%i == 0 and N//i < 10:
      print("Yes")
      break
    else:
      if i == 10:
        break
      else:
        i = i + 1

  

N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif (N==10 or N == 30 or N == 50 or N == 70 or N == 80 or isPrime(N)):
  print("No")
else:
  i = 2
  while(i<=9):
    if N%i == 0 and 1<=N//i <= 9:
      print("Yes")
      break
    else:
      if i == 9:
        print("No")
        break
      else:
        i = i + 1

  


N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif (N==10 or N == 30 or N == 50 or N == 70 or N == 80 or isPrime(N) or N>81):
  print("No")
else:
  i = 2
  while(i<=9):
    if N%i == 0 and 1<=N/i <= 9:
      print("Yes")
      break
    else:
      if i == 9:
        print("No")
        break
      else:
        i = i + 1

  


N = int(input())
if N>=1 and N<=81 and N!=30 and N!=50 and N!=60 and N!=70 and N!=80:
  print("Yes)
else:
  print("No")
   
  

N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif (N==10 or N == 30 or N == 50 or N == 70 or N == 80 or isPrime(N)):
  print("No")
else:
  i = 2
  while(i<=9):
    if N%i == 0 and 1<=N//i <= 9:
      print("Yes")
      break
    else:
      if i == 10:
        print("No")
        break
      else:
        i = i + 1

  


N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif (N==10 or N == 30 or N == 50 or N == 70 or N == 80 or isPrime(N)):
  print("No")
else:
  i = 2
  while(i<10):
    if N%i == 0 and N//i < 10:
      print("Yes")
      break
    else:
      if i == 10:
        print("No")
        break
      else:
        i = i + 1

  


N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif (N==10 or N == 30 or N == 50 or N == 70 or N == 80 or isPrime(N) or N>81):
  print("No")
else:
  i = 2
  while(i<=9):
    if N%i == 0 and 1<=N//i <= 9:
      print("Yes")
      break
    else:
      if i == 9:
        print("No")
        break
      else:
        i = i + 1

  


N = int(input())

def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

if N<=9:
  print("Yes")
elif ( N == 50 or N ==60 or N == 70 or N == 80 or isPrime(N) or N>81):
  print("No")
else:
  i = 2
  while(i<=9):
    if N%i == 0 and 1<=N/i <= 9:
      print("Yes")
      break
    else:
      if i == 9:
        print("No")
        break
      else:
        i = i + 1

  


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Accepted