Cod sursa(job #1790400)
Utilizator | Data | 28 octombrie 2016 10:35:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
bool ciur[2000023];
int n;
int main()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<=n;i++)
{
if(i*i<0) break;
if(ciur[i]==1) continue;
for(int j=i*i;j<=n;j+=i) ciur[j]=1;
}
int ct=0;
for(int i=2;i<=n;i++) if(!ciur[i]) ++ct;
printf("%d\n",ct);
}