Cod sursa(job #2196815)
Utilizator | Data | 20 aprilie 2018 14:31:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int N, c;
char prim[2000005];
int main()
{
int i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
for(i=2;i<=N;++i)
prim[i]=1;
for(i=2;i<=N;++i)
if(prim[i])
{
++c;
for(j=i+i;j<=N;j+=i)
prim[j]=0;
}
printf("%d",c);
return 0;
}