Pagini recente » Cod sursa (job #1621633) | Cod sursa (job #2164196) | Cod sursa (job #2764901) | Cod sursa (job #1104432) | Cod sursa (job #1791210)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int N;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> N;
int p{0};
int i, j;
vector <int> ar;
ar.push_back(0);
ar.push_back(0);
for (i = 2; i <= N; i++)
ar.push_back(1);
for (i = 2; i <= N / 2; i++)
for (j = 2; j <= N / i; j++)
ar[i*j] = 0;
//for (i = 1; i <= N; i++)
// if (ar[i]) p++;
p = count(ar.begin(),ar.end(),1);
fout << p;
return 0;
}