欧拉筛法.

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int Ture[1000];
int arr[100];
int main()
{
	int n;
	int m = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		Ture[i] = 1;//初始化为1
	}
	for (int i = 2; i <= n; i++)
	{
		if (Ture[i] == 1)
		{
			arr[m] = i;
			m++;
		}
		for (int j = 0; j < m&&i*arr[j]<=n; j++)
		{
			Ture[i * arr[j]] = 0;
			if (i % arr[j] == 0)//该步可以避免多次重复的标记，使运行时间大大减小
			{
				break;
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}