Pagini recente » Cod sursa (job #1225237) | Cod sursa (job #1639516) | Cod sursa (job #1757090) | Cod sursa (job #2736926) | Cod sursa (job #2347413)
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
typedef pair<int, int> pii;
bool ciur[2000001];
int N, M;
inline void Solve(int N) {
int sol = 0;
for(int i = 2; i <= N; ++i) {
if (!ciur[i]) {
++sol;
for (int j = i*1LL*i; j <= N; j += i) {
ciur[j] = true;
}
}
}
// for(int i = 2; i <= 100; ++i) {
// cout << i <<" "<< ciur[i]<<"\n";
// }
cout << sol << "\n";
}
int main(){
int i;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
// ios::sync_with_stdio(false);
cin >> N;
Solve(N);
return 0;
}