Cod sursa(job #1220920)
| Utilizator | Data | 18 august 2014 23:31:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
char v[2000005];
int n,cnt;
void citire()
{
scanf("%d", &n);
}
void ciur()
{
int i,j;
v[0]=1;
v[1]=1;
for(i=2;i<=n;++i)
if(v[i]==NULL)
for(j=i+i;j<=n;j+=i)
v[j]=1;
cnt=0;
for(i=2;i<=n;++i)
if(v[i]==NULL)
++cnt;
}
void afisare()
{
printf("%d\n", cnt);
}
void rezolva_problema()
{
citire();
ciur();
afisare();
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
rezolva_problema();
return 0;
}
