Cod sursa(job #2020328)

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

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

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

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

	int primes = 0;	

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

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

	return 0;
}