Cod sursa(job #917280)
| Utilizator | Data | 17 martie 2013 16:03:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define M 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nrp;
bool a[M];
int main()
{
fin>>n;
fin.close();
std::fill_n(a, M, true);
for(int i=2; i<=n; i++)
if(a[i] == true){
nrp++;
for(int j =i+i; j<=n; j+=i)
a[j] = false;
}
fout<<nrp;
fout.close();
return 0;
}
