Cod sursa(job #811301)
Utilizator | Dobre Bogdan Mihai dobrebogdan | Data | 11 noiembrie 2012 21:09:32 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<stdio.h>
bool v[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j,m;
scanf("%d",&n);
m=0;
for(i=2;i<=n;i++)
if(v[i]==0)
{
for(j=i+i;j<=n;j=j+i)
v[j]=1;
m++;
}
printf("%d",m);
return 0;
}