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

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
 
#define int long long int
#define pb push_back
#define mp make_pair
#define loop(i,x,n) for(int i=x;i<=n;i++)
#define rloop(i,x,n) for(int i=x;i>=n;i--)
 
typedef vector<int> v64;
typedef pair<int,int> p64;
typedef vector<p64> vp64;
typedef set<int> s64;
typedef map<int,int> m64;
typedef multiset<int> ms64;
typedef multimap<int,int> mm64;
typedef greater<int> g64;
typedef unordered_set<int> us64;
typedef unordered_map<int,int> um64;
 
int32_t main(){
    int n;
    cin>>n;
    bool flg = false;
    loop(i,1,9){
        if(n%i==0){
            if(n/i>=1 && n/i<=9) {flg = true; break;}
        }
    }      
    if(flg) cout<<"YES\n";
    else cout<<"NO\n";
    return 0;
}