Pagini recente » Cod sursa (job #2247617) | Cod sursa (job #2143612) | Cod sursa (job #2980863) | Cod sursa (job #1509963) | Cod sursa (job #2536386)
#include <bits/stdc++.h>
#include <math.h>
#include <fstream>
using namespace std;
typedef long long int lint;
bool v[2000000];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, cnt = 0;
fin>>n;
for(int i = 1; i <= n; i++)
{
v[i] = i;
}
for (int i = 2; i * i <= n; i += 2)
{
for (int j = i * i; j <= n; j += i)
{
v[j] = 1;
}
if (i == 2)
i--;
}
for(int i = 1; i <= n; i++)
{
if(v[i] > 1)
{
cnt++;
}
}
fout<<cnt;
fin.close();
fout.close();
return 0;
}