Pagini recente » Borderou de evaluare (job #1692752) | Cod sursa (job #2879798) | Cod sursa (job #3202087) | Cod sursa (job #494202) | Cod sursa (job #1596935)
#include <iostream>
#include <fstream>
#define MAX 2000003
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[MAX];
//int prim[100000];
long n,k;
int main() {
in >> n;
for(long i = 2; i <= n; i++) {
if(!v[i]) {
k++;
long mult = i*i;
while(mult > 0 && mult < MAX-3) {
v[mult] = 1;
mult += i;
}
}
}
out << k;
return 0;
}