PAT-A1013. 数素数 (20)

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

const int maxn = 200000;
int prime[maxn], cnt = 0;
int M, N;
bool p[maxn];

int isPrime(int n)
{
if (n <= 1)
return 0;
int sqr = sqrt(1.0*n);
for (int i = 2; i <= sqr; i++)
{
if (n%i == 0)
return 0;
}
return 1;
}

void Find_Prime()
{
for (int i = 2; i < maxn; i++)
{
if (isPrime(i))
{
prime[cnt++] = i;
p[i] = true;
if (cnt > N)
break;
}
}
}

int main()
{
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
scanf("%d %d", &M, &N);
Find_Prime();
int k = 0;
for (int i = M-1; i <= N-1; i++)
{
k++;
printf("%d", prime[i]);
if (k == 10)
{
printf("\n");
k = 0;
}
else if (i != N-1)
printf(" ");
}
return 0;
}