Pagini recente » simulareonidouamiioptclasanoua | Istoria paginii runda/lab10d30mai2014 | Istoria paginii admin/yagenazac | Autentificare | Cod sursa (job #1567757)
#include <stdio.h>
#include <math.h>
#define N_MAX 2000003
using namespace std;
int n;
bool v[N_MAX];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
int rad = sqrt(n);
int i, j;
int counter;
for (i = 2; i <= rad; ++i){
if (!v[i]){
for (j = i; i * j <= n; ++j){
v[i*j] = true;
}
}
}
counter = 0;
for (i = 2; i <= n; ++i)
if (!v[i]) counter++;
printf("%d\n", counter);
return 0;
}