Cod sursa(job #654189)
| Utilizator | Data | 29 decembrie 2011 19:59:35 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
#define lim 2000002
long long p[lim],v[lim],n;
void citire(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld",&n);
}
long long ciur (){
long long k=0;
for(int i=2;i<=n;i++)
if(!v[i]){
k++;
for(int j=i+i;j<=n;j+=i)
v[j]=1;
}
return k;
}
int main (){
citire();
printf("%lld",ciur());
return 0;
}
