Pagini recente » Cod sursa (job #2677667) | Cod sursa (job #725166) | Cod sursa (job #2311900) | Cod sursa (job #684887) | Cod sursa (job #622097)
Cod sursa(job #622097)
#include <vector>
#include <stdio.h>
using namespace std;
bool c[2000001];
int main() {
long N, nr = 0, i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%ld", N);
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] = true;
}
for(i = 2; i <= N; i++)
if(!c[i])
nr++;
printf("%ld", nr);
}