5、输出前1000的素数
#include<bits/stdc++.h>
#include<cmath>
int isprime(int a);
int k = 2;
using namespace std;
int main(){
int j = 0;
for (int i = 2;j<=1000;i++){
k = 2;
int jd = isprime(i);
if(jd==1){
cout << i << "\t";
j++;
}else if(i==2){
cout << 2 << "\t";
j++;
}
}
return 0;
}
int isprime(int a){
int jd = 1;
for (k = 2; k <= sqrt(a);k++){
if(a%k==0){
jd = 0;
break;
}
}
return jd;
}