PAT乙组 素数NM

#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(int n){
	if(n <= 3) return n > 1;

	if( n%6 != 1 && n%6 != 5 )
		return false;

	int _sqrt = sqrt(n);
	for (int i = 5;i <= _sqrt;i+=6)
	{
		if(n%i == 0 || n%(i+2) == 0)
			return false;
	}
	return true;
}

int main()
{
	int N,M;
	int flag = 0;
	int flag2 = 0;
	int i = 2;

	cin>>M>>N;

	while(flag <= N)
	{
		if(isPrime(i)){
			flag++;

			if(flag >= M && flag <= N)
			{
				flag2++;
				if(flag2 == 10){
					cout<<i<<endl;
					flag2 = 0;
					i++;
					continue;
				}
			if(flag != N)
				cout<<i<<" ";
			else
				cout<<i;
			}
		}
		
		i++;
	}
	return 0;
}