#include <iostream>
#include <cmath>
using namespace std;
int prim(int a[], int n)
{
a[0] = 2;
int p = 1;
for(int i = 3; i < n; i+=2)
{
bool isprim = true;
for(int j = 0; a[j] < sqrt(i); j++)
{
if(i%a[j] == 0)
{
isprim = false;
break;
}
}
if(isprim == true)
a[p++] = i;
}
return p;
}
int main()
{
int a[10000];
int n = prim(a, 10000);
cout << n << endl;
for(int i = 0; i < n; i ++)
cout << a[i] << " ";
return 0;
}
求素数
最新推荐文章于 2022-10-23 20:43:17 发布