Submission #8147569


Source Code Expand

Copy
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; //check the limits, dummy
 
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);    
	
	int N; cin >> N;
	FOR(i, 1, 10) {
		FOR(j, 1, 10) {
			if (i*j == N) {
				cout << "Yes" << endl;
				return 0;
			}
		}
	}
	cout << "No" << endl;
	
	
	return 0;
}
 
// read the question correctly (ll vs int)
// template by bqi343

Submission Info

Submission Time
Task B - 81
User Geothermal
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1533 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01, sample_02, sample_03
All 200 / 200 random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, random_09, random_10, random_11, random_12, random_13, random_14, random_15, random_16, random_17, random_18, random_19, random_20, sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
random_01 1 ms 256 KB
random_02 1 ms 256 KB
random_03 1 ms 256 KB
random_04 1 ms 256 KB
random_05 1 ms 256 KB
random_06 1 ms 256 KB
random_07 1 ms 256 KB
random_08 1 ms 256 KB
random_09 1 ms 256 KB
random_10 1 ms 256 KB
random_11 1 ms 256 KB
random_12 1 ms 256 KB
random_13 1 ms 256 KB
random_14 1 ms 256 KB
random_15 1 ms 256 KB
random_16 1 ms 256 KB
random_17 1 ms 256 KB
random_18 1 ms 256 KB
random_19 1 ms 256 KB
random_20 1 ms 256 KB
sample_01 1 ms 256 KB
sample_02 1 ms 256 KB
sample_03 1 ms 256 KB