Cod sursa(job #710735)

Utilizator miu_mik93FMI - Paduraru Miruna miu_mik93 Data 10 martie 2012 17:37:31
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include<iostream>
#include<math.h>
#include<fstream>
#include<string.h>
#include<stdio.h>
#include<assert.h>
using namespace std;
int main(void)
{
	int n,prim = 0;
	int i, j;
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);
	scanf("%d", &n);
	bool* eratostene = new bool[n];
	for (i = 0; i <= n; i++)
		eratostene[i] = true;
	for (i = 2; i <= n; i++)
		if (eratostene[i])
		{
			prim++;
			for(j = i+i; j <= n; j += i)
				eratostene[j] = false;
		}
	printf("%d", prim);
	return 0;
}