Cod sursa(job #865358)

Utilizator gabriel.badeaGabriel Badea gabriel.badea Data 26 ianuarie 2013 13:16:13
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.34 kb
#include <stdio.h>

int main(void)
{
	int N, i, j, cnt;
	char prim[2000005];
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);
	scanf("%d", &N);
	for(i=2;i<=N;++i)
		prim[i] = 1;
	for(i=2;i<=N;++i)
		if(prim[i])
		{
			++cnt;
			for(j=i+i;j<=N;j+=i)
				prim[j] = 0;
		}
		printf("%d", cnt);

		return 0;
}