Cod sursa(job #641697)
| Utilizator | Data | 29 noiembrie 2011 10:17:10 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int cnt=0;
char prim[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j,n;
scanf("%i", &n);
for(i=2;i<=n;i++)
{
prim[i]=1;
}
for(i=2;i<=n;i++)
{
if(prim[i])
{
cnt++;
for(j=i+i;j<=n;j+=i)
{
prim[j]=0;
}
}
}
printf("%i", cnt);
scanf("%i", &i);
return 0;
}
