数学问题——数素数

#include<stdio.h>
const int maxn = 1000001;
int prime[maxn], num = 0;
bool p[maxn] = {
    
    0};

void Find_Prime(int n)
{
    
    
	for(int i = 2; i < maxn; i++)
	{
    
    
		if(p[i] == false)
		{
    
    
			prime[num++] = i;
			if(num >= n) break;
			for(int j = i + i; j < maxn; j = j + i)
			{
    
    
				p[j] = true;
			}
		}
	}
}

int main()
{
    
    
	int m, n, count = 0;
	scanf("%d%d", &m, &n);
    Find_Prime(n);
    for(int i = m - 1; i < n; i++)
    {
    
    
    	count++;
    	if(count % 10 != 0 && i < n - 1) printf("%d ", prime[i]);
    	else if(count % 10 == 0 && i < n - 1) printf("%d\n", prime[i]);
    	     else if(i == n - 1) printf("%d", prime[i]);
	}
	return 0;
}