超神的质数判断

速度很快，嗯。

#include<bits/stdc++.h>
#define mst(a,b) memset(a,b,sizeof(a))
#define For(i, k, j) for(register int i = (k); i <= (j); i++)
#define INF 2147483647
using namespace std;
inline int read()
{
    int num = 0;
    char c=' ';
    bool flag = 1;
    for(;c>'9'||c<'0';c=getchar()) if(c=='-') flag = -1;
    for(;c>='0'&&c<='9';num=(num<<1)+(num<<3)+c-48,c=getchar());
    return num * flag;
}
inline bool isprime(int a) {
    if(a == 1) return 0;
    if(a == 2 || a == 3) return 1;
    if(a%6 != 1 && a%6 != 5) return 0;
    int g = sqrt(a);
    for(int i = 5; i <= g; i += 6) {
        if(!(a%i)|| !(a%(i+2))) return 0;
    }
    return 1;
}
int main()
{
	int n = read(), m = read();
	For(i, 1, n) {
		int k = read();
		if(isprime(k)) printf("Yes\n");
		else printf("No\n");
	}



    return 0;
}