Pagini recente » Cod sursa (job #2793366) | Cod sursa (job #922342) | Cod sursa (job #2277657) | Cod sursa (job #2729825) | Cod sursa (job #622100)
Cod sursa(job #622100)
#include <vector>
#include <stdio.h>
using namespace std;
int main() {
long N, nr = 0, i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%ld", &N);
vector<bool> c(2000001, true);
for(i = 2; i * i <= N; i++) {
if(c[i])//i prim
for(j = i * i; j <= N; j += i)//marchez multiplii sai
c[j] = false;
}
for(i = 2; i <= N; i++)
if(c[i])
nr++;
printf("%ld", nr);
return 0;
}