Cod sursa(job #1651294)
| Utilizator | Data | 12 martie 2016 22:56:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
//#include "definitions.h"
#define MAX_N 900000
using namespace std;
int countPrimes(long n) {
bool sieve[MAX_N];
int count = 0;
for (long i = 0; i<n; i++)
sieve[i] = true;
for (long i = 2; i<n; i++) {
if (sieve[i] == true) {
for (long index = i; index < n; index+=i) {
sieve[index] = false;
}
count++;
}
}
return count;
}
int main() {
ifstream f("ciur.in");
ofstream g("ciur.out");
long n;
f>>n;
g<<countPrimes(n);
return 0;
}
