PTA 乙级 1013 数素数

代码实现：

#include<stdio.h>
#include<math.h>

int isPrime(int num)
{
	if (num == 1)return 0;
	for (int i = 2; i <= sqrt(num); i++)if (num%i == 0)return 0;
	return 1;
}

int main()
{
	int M, N, a[10000];

	scanf("%d %d", &M, &N);
	for (int i = 2, j = 0; j < 10000; i++)
		if (isPrime(i) == 1)a[j++] = i;
	int cnt = 0;
	for (int i = M - 1; i < N ; i++)
	{
		printf("%d", a[i]);
		cnt++;
		if (cnt == 10)
		{
			printf("\n"); cnt = 0;
		}
		else if (i != N - 1) printf(" ");
	}

	return 0;
}