Pagini recente » Cod sursa (job #2250994) | Cod sursa (job #2254541) | Cod sursa (job #2843153) | Borderou de evaluare (job #2680572) | Cod sursa (job #3298029)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX=2e6;
int n,i,j,cnt;
bool ciur[MAX+5];
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
for (i=2; i*i<=n; i++)
if (!ciur[i])
for (j=i*i; j<=n; j=j+i)
ciur[j]=1;
for (i=1; i<=n; i++)
if (!ciur[i])
cnt++;
fout<<cnt;
return 0;
}