#include<stdio.h>#include<math.h>intmain(){
int i;
int N;
int j;
scanf("%d",&N);
for(i = 2;i<= N;i++){
int k =0;
for(j= 2;j<i;j++)
if(i%j==0)
k=1;
if(k==0)
printf("%d\n",i);
}
return0;
}
weixin_39814378的博客于是照着网上的办法弄了一个辅助布尔型数组来改进一下,然后就变成这样了……结果是2The total of the primes are: 1代码如下#include#include#define N 10000using namespace std;int main(){ofstream outfile;outf...