## 量子流逝

-----------------------------I Will Fight For My Dream

# SGU 113 Nearly prime numbers

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);

i64 gcd(i64 _a, i64 _b)
{
if (!_a || !_b)
{
return max(_a, _b);
}
i64 _t;
while (_t = _a % _b)
{
_a = _b;
_b = _t;
}
return _b;
};

i64 ext_gcd (i64 _a, i64 _b, i64 &_x, i64 &_y)
{
if (!_b)
{
_x = 1;
_y = 0;
return _a;
}
i64 _d = ext_gcd (_b, _a % _b, _x, _y);
i64 _t = _x;
_x = _y;
_y = _t - _a / _b * _y;
return _d;
}

i64 invmod (i64 _a, i64 _p)
{
i64 _ans, _y;
ext_gcd (_a, _p, _ans, _y);
_ans < 0 ? _ans += _p : 0;
return _ans;
}

int n;
int a;
vector<int>p;
int re;

bool can(int x)
{
int temp = sqrt(x);
for(int i=0;i<p.size();i++)
{
if(!(x%p[i]) && x!=p[i])
{
re = p[i];
return true;
}
if(p[i]>temp)
{
return false;
}
}
return false;
}

void init_prime()
{
p.clear();
p.push_back(2);
for(int i=2;i<=40000;i++)
{
if(!can(i))
{
p.push_back(i);
}
}
return ;
}

int main()
{
init_prime();
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a;
if(!can(a))
{
cout<<"No.."<<endl;
}
else
{
a/=re;
if(!can(a))
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
}
return 0;
}


#### sgu 113 Nearly prime numbers

2015-03-19 08:22:38

#### SGU 113 Nearly prime numbers（素数判定）

2016-04-14 18:59:16

#### SGU - 113 - Nearly prime numbers （素数）

2015-03-12 10:17:18

#### [SGU]113. Nearly prime numbers

2012-10-28 20:42:10

#### 【string】#84 A. Nearly Lucky Number

2014-11-29 21:24:33

#### SGU 113. Nearly prime numbers 素数

2013-08-01 21:07:34

#### 【SGU】113. Nearly prime numbers 合数分解

2014-11-06 11:29:56

#### sgu113：Nearly prime numbers

2014-10-03 23:22:31

#### 113. Nearly prime numbers

2014-11-10 16:41:23

#### HDU 2138 How many prime numbers【素数判断，卡时间！！】

2016-01-15 18:07:57