Cod sursa(job #1095024)

Utilizator anaid96Nasue Diana anaid96 Data 30 ianuarie 2014 11:26:45
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include<stdio.h>

FILE *in,*out;

//constante
const int Nmax=(int)2e6+5;

//varibile
int n,answer;
bool notPrime[Nmax];

int main(void)
{
	in=fopen("ciur.in","rt");
	out=fopen("ciur.out","wt");
	fscanf(in,"%d",&n);
	
	for(int i=2; i<=n; ++i)
	{
		if(!notPrime[i])
		{
			++answer;
			for(int j=i+i; j<=n; j+=i)
				notPrime[j]=true;
		}	
	}	
	fprintf(out,"%d\n",answer);
	fclose(in);
	fclose(out);
	return 0;
}