Cod sursa(job #566691)
| Utilizator | Data | 29 martie 2011 10:53:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
bool Ciur[2000003];
int Calculeaza(int N)
{
int count=0;
for (int nr=2; nr<=N; nr++)
{
if (!Ciur[nr]){
count++;
for (int i=nr*2; i<=N; i+=nr)
Ciur[i] = true;
}
}
return count;
}
int main()
{
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int n; in>>n;
out<<Calculeaza(n)<<"\n";
in.close();
out.close();
return 0;
}
