Pagini recente » Cod sursa (job #1783473) | Cod sursa (job #2584991) | Istoria paginii runda/concurs_nou1/clasament | Cod sursa (job #700114) | Cod sursa (job #1000939)
#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;
for(int i=2;i<=n;i++)
ns[i]=1;
for(int i=3; i<=n; i+=2)
if(ns[i])
{
nr++;
for (int j = i+i; j<=n; j+=i)
ns[j]=1;
}
fout << nr;
return 0;
}