Cod sursa(job #2020334)

Utilizator bcrisBianca Cristina bcris Data 9 septembrie 2017 21:30:07
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include <stdio.h>

#define NMAX 2000005
int n; 
bool prime[NMAX];

int main() {
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);

	scanf("%d\n", &n);


	int primes = 0;	

	if (n >= 2)
		primes++;

	for (int i = 3; i <= n; i += 2)
		if (prime[i] == 0) {
			primes++;
			for (int j = i + i; j <= n; j += i) {
				prime[j] = 1;
			}
		}

	printf("%d\n", primes);

	return 0;
}