Cod sursa(job #657825)
Utilizator | Data | 7 ianuarie 2012 14:51:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,nrp=0,i,j;
char ciur[2000000];
scanf("%d",&n);
for (i=2;i<=n;i++)
ciur[i]=1;
for (i=2;i<=n;i++)
if (ciur[i])
for (j=i+i;j<=n;j+=i)
ciur[j]=0;
for(i=2;i<=n;i++) if(ciur[i]) nrp++;
printf("%d",nrp);
return 0;
}