Pagini recente » Cod sursa (job #652693) | Rating Iancu Daniel (Cut3Po1SoN) | Cod sursa (job #2940152) | Cod sursa (job #2384473) | Cod sursa (job #1000930)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int maxN = 2000005;
int ns[maxN];
int main()
{
int n;
fin >> n;
int nr=0;
int lim = sqrt(n);
for(int i=2; i<=n; i++)
if(!ns[i])
{
nr++;
if(i<=lim)
for (int j = i+i; j<=n; j+=i)
ns[j]=1;
}
fout << nr;
return 0;
}