Cod sursa(job #908031)
Utilizator | Data | 8 martie 2013 17:35:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<cstdio>
long int n,i,j,k;
bool v[1000001];
void ciur()
{
for(i=2;i<=n;i++)
if(v[i]==false){
k++;
for(j=i;j<=n/i;j++)
v[i*j]=true;
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
ciur();
printf("%ld",k);
return 0;
}