Pagini recente » Cod sursa (job #2697620) | Cod sursa (job #1077533) | Cod sursa (job #1909611) | Cod sursa (job #2689842) | Cod sursa (job #2536405)
#include <bits/stdc++.h>
#include <math.h>
#include <fstream>
using namespace std;
typedef long long int lint;
bool v[2000000];
int n, cnt = 0;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void rezolvare()
{
for (int i = 2; i <= n; i += 2)
{
if(v[i] != 2)
{
v[i] = 1;
}
}
for(int i = 3; i <= sqrt(n); i++)
{
for(int j = i*i; j <= n; j++)
{
v[j] = 1;
}
}
}
int main()
{
fin>>n;
rezolvare();
for(int i = 1; i <= n; i++)
{
if(v[i] != 1)
{
cnt++;
}
}
fout<<cnt;
fin.close();
fout.close();
return 0;
}