Pagini recente » IOIT_CAZAN_137TESLA | Istoria paginii runda/concurs_y | Istoria paginii runda/luca_oji4/clasament | Cod sursa (job #1941491) | Cod sursa (job #1596976)
#include <fstream>
#include <cmath>
#define MAX 2000003
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[MAX];
int n,k;
int main() {
in >> n;
int sq = sqrt(n);
/*for(int i = 2; i <= n; i += 2) // useless
v[i] = 1;*/
for(int i = 3; i <= n; i += 2) {
if(v[i] == 0) {
k++;
if(i > sq)
continue;
for(int mult = i*i; mult <= n; mult += i)
v[mult] = 1;
}
}
out << k+1;
return 0;
}