Cod sursa(job #1830385)
Utilizator | Data | 16 decembrie 2016 17:43:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,*a,i,nr=1,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
a=calloc(2000002,sizeof(int));
for(i=3; i<=n; i+=2)
{
if(a[i]==0)
{
nr++;
for(j=i; j<=n; j+=i)
a[j]=1;
}
}
printf("%d\n",nr);
return 0;
}