Cod sursa(job #261888)
Utilizator | Data | 18 februarie 2009 20:39:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
char v[200000001];
long b,i,j,p;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&b);
v[1]=1;
for(i=1;i<=b;i++)
if(v[i]==0)
for(j=2;j*i<=b;j++)
v[i*j]=1;
p=0;
for(i=2;i<=b;i++) if(v[i]==0) p++;
printf("%ld",p);
return 0;
}