Pagini recente » Cod sursa (job #2394038) | Cod sursa (job #1937174) | Cod sursa (job #636759) | Cod sursa (job #2944339) | Cod sursa (job #1532901)
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int ciurulLuiEratosthenes(int N) {
bool* prime = new bool[N];
for(int i = 0; i < N; ++i) {
prime[i] = true;
}
prime[0] = prime[1] = false;
for(int i = 2; i <= sqrt(N); ++i) {
if(prime[i]) {
for(int k = i*i; k < N; k += i) {
prime[k] = false;
}
}
}
int total = 0;
for(int i = 0; i < N; ++i) {
if(prime[i]) {
total++;
}
}
return total;
}
int main(int argc, char const *argv[])
{
FILE *fIn, *fOut;
int N;
if((fIn = fopen("ciur.in", "r")) == NULL) {
fprintf(stderr, "Can't open FIle!\n");
return -1;
}
fOut = fopen("ciur.out", "w");
fscanf(fIn, "%d", &N);
int res = ciurulLuiEratosthenes(N);
fprintf(fOut, "%d\n", res );
return 0;
}