AcWing 3529. 连续合数段
原题链接
简单
作者:
yxc的小迷妹
,
2023-08-08 18:32:44
,
所有人可见
,
阅读 172
#include <iostream>
using namespace std;
const int N = 10010;
int a, b;
int primes[N], cnt;
bool st[N];
void get_primes(int n)
{
for (int i = 2; i <= n; i ++)
{
if (!st[i]) primes[cnt ++] = i;
for (int j = 0; primes[j] * i <= n; j ++)
{
st[primes[j] * i] = 1;
if (i % primes[j] == 0) break;
}
}
}
int main()
{
cin >> a >> b;
get_primes(b);
int len = 0, end;
for (int i = a, s = 0; i <= b; i ++)
if (!st[i]) s = 0;
else
{
s ++;
if (s > len) len = s, end = i;
}
for (int i = end - len + 1; i <= end; i ++)
cout << i << ' ';
return 0;
}