Cod sursa(job #1299825)
| Utilizator | Data | 23 decembrie 2014 21:24:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur(int n) {
int i, j, cnt = 0;
bool A[nmax];
for (i = 2; i <= n; i++)
if (!A[i]) {
cnt++;
for (j = 2 * i; j <= n; j += i)
A[j] = 1;
}
return cnt;
}
int main() {
int n;
fin >> n;
fout << ciur(n) << "\n";
fin.close();
fout.close();
return 0;
}