埃氏筛方法

#include <bits/stdc++.h>
#define DEBUG(var) cout << "[DEBUG]" << #var << " = " << var << endl
using namespace std;
bool isPrime[100];
void Prime(int n) {
	memset(isPrime, true, sizeof(isPrime));
	for (int i = 2; i <= n; i++) {
		if (!isPrime[i]) continue;
		for (int j = i; j < n; j += i) {
			isPrime[j] = false;
		}
	}
}

int main() {
	int n;
	scanf("%d", &n);
	Prime(n);
	for (int i = 2; i <= n; i++) {
		cout << isPrime[i] << ' ';
	}
	return 0;
}