-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathCHEFPRMS.cpp
129 lines (124 loc) · 2.25 KB
/
CHEFPRMS.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/*
written by Pankaj Kumar.
country:-INDIA
*/
#include <bits/stdc++.h>
using namespace std;
// policy based ds
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll ;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef map<ll,ll> ml;
#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
// define values.
#define mod 10000009
#define phi 1.618
/* Bit-Stuff */
#define get_set_bits(a) (__builtin_popcount(a))
#define get_set_bitsll(a) ( __builtin_popcountll(a))
#define get_trail_zero(a) (__builtin_ctz(a))
#define get_lead_zero(a) (__builtin_clz(a))
#define get_parity(a) (__builtin_parity(a))
/* Abbrevations */
#define ff first
#define ss second
#define mp make_pair
#define line cout<<endl;
#define pb push_back
#define Endl "\n"
// loops
#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
// Some print
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
#define cc ll test;cin>>test;while(test--)
// sort
#define all(V) (V).begin(),(V).end()
#define srt(V) sort(all(V))
#define srtGreat(V) sort(all(V),greater<ll>())
// function
ll power(ll x,ll y)
{
ll res=1;
// x=x%mod;
while(y>0)
{
if(y%2==1)
{
res*=x;
// res=res%mod;
}
y/=2; x*=x; // x=x%mod;
}
return res;
}
// datatype definination
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
/* ascii value
A=65,Z=90,a=97,z=122
*/
/* -----------------------------------------------------------------------------------*/
ll prime(ll num)
{
for(ll i=2;i<=ll(sqrt(num));i++)
{
if(num%i==0)
return 0;
}
return 1;
}
ll solve()
{
vl ans;
for(ll i=2;i<=200;i++)
{
if(prime(i)==1)
ans.pb(i);
}
cc
{
ll n;
cin>>n;
ll flag=0;
for(ll i=0;i<ans.size()-1;i++)
{
for(ll j=i+1;j<ans.size();j++)
{
ll temp=ans[i]*ans[j];
ll rest=n-temp;
for(ll k=0;k<ans.size()-1;k++)
{
for(ll l=k+1;l<ans.size();l++)
{
if((ans[k]*ans[l])==rest)
{
flag=1;
break;
}
}
if(flag==1)
break;
}
if(flag==1)
break;
}
if(flag==1)
break;
}
if(flag==1)
yes
else
no
}
return 0;
}
int main()
{
//freopen("input.txt"a, "r", stdin);
pan;
solve();
}