Cod sursa(job #1331296)
Utilizator | Data | 31 ianuarie 2015 15:09:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#define N 2000001
using namespace std;
bool p[N];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j;
scanf("%d",&n);
for(i= 2 ; i * i <= N; i++)
for(j= i * i ; j*j<=N ; j=j+i ) p[j]=1;
int nr=0;
for(i= 2 ;i<=n ; i++ )
if(p[i]==0)nr++;
printf("%d",nr);
return 0;
}