Pagini recente » Cod sursa (job #2457038) | Cod sursa (job #2836816) | Cod sursa (job #1928697) | Cod sursa (job #2522851) | Cod sursa (job #2536111)
#include <bits/stdc++.h>
#include <math.h>
#include <fstream>
using namespace std;
typedef long long int lint;
int v[2000005];
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;
}
cnt = n-1;
for (int i = 2; i * i <= n; i += 2)
{
for (int j = i * i; j <= n; j += i)
{
cnt--;
}
if (i == 2)
i--;
}
fout<<cnt<<endl;
fin.close();
fout.close();
return 0;
}