#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 100005;
int prime[N], p, q, l = 0, s[N];
void set()//求小于N的质数
{
int i, j;
memset(prime, 0, sizeof(prime));
for (i = 2; i < N; i++)
{
if (prime[i])
continue;
for (j = i + i; j < N; j += i)
prime[j] = 1;
s[l++] = i;
}
}
int main() {
set();
}
C 求n以内的素数并用数组存储
最新推荐文章于 2024-09-25 15:45:35 发布