Cod sursa(job #238673)

Utilizator baktakNicoleta Iordachi baktak Data 2 ianuarie 2009 22:25:55
Problema Ciurul lui Eratosthenes Scor 30
Compilator c Status done
Runda Arhiva educationala Marime 0.47 kb
/*ciur eratoshene */

#include<stdio.h>

//const int NMAX= 200;

int main(){
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);
	
	int n,v[2000000];
	int nr=1;	/*nr de nr prime*/
	int i,ip,j;		/*var aux*/

	scanf("%d",&n);	
	
	/* initializare vector */
	for(i=2;i<=n;i++)
		v[i]=1;
	
	/* verificam daca un nr e prim 
	din 2 in 2 			*/
	for(i=3; i<=n; i+=2){
		if(v[i]){
			for(j=i+i; j<=n; j+=i)
				v[j]=0;
			nr++;
			}
		}
	printf("%d\n", nr);
	
	return 0;
	}