51Nod 1106 质数检测

题目链接

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
int prime(int x){
if(x==2||x==3) return 1;
int num=sqrt(x);
for(int i=2;i<=num;i++) if(x%i==0) return 0;
return 1;
}
int main(){
int n;
cin>>n;
while(n--){
int num;
cin>>num;
if(prime(num)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}