Cod sursa(job #1697214)

Utilizator Pley01Nitu Madalin Pley01 Data 1 mai 2016 00:43:01
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.37 kb
#include <stdio.h>

int N, cnt;
char prim[2000005];

int main(void)
{
	int i, j;

	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\n", cnt);

	return 0;