Cod sursa(job #443532)
Utilizator | Data | 17 aprilie 2010 13:04:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, p[2000000], no;
void sterge(int k)
{ for(int j=k; j<=n; j+=k)
p[j]=0;
}
int main()
{
fin>>n;
for(i=2;i<=n;i++) p[i]=1;
for(i=2;i<=n;i++) if(p[i]) ++no, sterge(i);
fout<<no;
return 0;
}