Cod sursa(job #698196)
Utilizator | Data | 29 februarie 2012 12:52:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
using namespace std;
#include<fstream>
#include<iostream>
#include<cstdio>
int a[2000002];
int main ()
{ int i,j,n,s=1;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=3;i<=n;i=i+2)
if(a[i]==0)
{ s++;
for(j=i*i;j<=n;j=i+j)
a[j]=1;
}
printf("%d",s);
return 0;
}