Cod sursa(job #1134807)
| Utilizator | Data | 6 martie 2014 22:05:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
long long int n;
bool t[2000010];
void ciur()
{
for(int i=2;i*i<n+2;i++)
{
if(t[i]==false)
{
for(int j=i+i;j<n+2;j+=i) t[j]=true;
}
}
}
int main()
{freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld",&n);
ciur();
long int nr=0;
for(int i=2;i<=n;i++) if(!t[i]) nr++;
printf("%ld",nr);
return 0;
}
