Cod sursa(job #2422169)
Utilizator | Data | 17 mai 2019 17:34:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#include <stdlib.h>
int ciur[2000000];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j,nr=0;
scanf("%d",&n);
for(i=2;i<=n;i++)
{
if(!ciur[i])
{
nr++;
for(j=i+i;j<=n;j=j+i)
{
ciur[j]=1;
}
}
}
printf("%d",nr);
return 0;
}