Cod sursa(job #694015)

Utilizator Daniel30daniel Daniel30 Data 27 februarie 2012 18:07:41
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.32 kb
Raporteaza aceasta sursa 
#include<cstdio>
#define Nmax 2000005
using namespace std;
bool a[Nmax];
int n,nr=0;
int main()
{freopen("ciur.in","rt",stdin);
 freopen("ciur.out","wt",stdout);
 scanf("%d",&n);
 for(register int i=2;i<=n;++i)
	 if(!a[i])
	   {nr++;for(register int j=i;j<=n;j+=i) a[j]=true;}
 printf("%d\n",nr);
 return 0;
}