Pagini recente » Cod sursa (job #2736986) | Cod sursa (job #3231931) | Cod sursa (job #2111711) | Cod sursa (job #2888281) | Cod sursa (job #3163164)
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N = 2000001;
bool p[N];
int n;
void ciur()
{
p[0]=p[1]=1;
int i, j;
for(i=2; i*i<=n; i++)
if(p[i]==0)
for(j=i*i; j<=n; j+=i)
p[j]=1;
}
int main()
{
int i, k = 0;
fin >> n;
ciur();
if(n>=2)k=1;
for(i=3; i<=n; i+=2)
if(!p[i])k++;
fout<<k<<'\n';
return 0;
}