Cod sursa(job #159172)
| Utilizator | Data | 13 martie 2008 23:31:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
unsigned char V[2000005];
int N;
void citire()
{
freopen("ciur.in","r",stdin);
scanf("%d",&N);
}
void ciur()
{
V[0]=1;
V[1]=1;
V[2]=0;
V[3]=0;
V[4]=1;
V[5]=0;
for (int i=2;i<=N;++i)
{
if (V[i]==0)
for (int j=2;j<=N;++j)
V[i*j]=1;
}
}
void afisare()
{
freopen("ciur.out","w",stdout);
long int s=0,i;
for (i=0;i<N;++i)
if (V[i]==0)
s++;
printf("%ld\n",s);
}
int main()
{
citire();
ciur();
afisare();
return 0;
}
