Cod sursa(job #444732)
Utilizator | Data | 21 aprilie 2010 14:46:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 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]=1;
}
int main()
{
fin>>n;
for(i=2;i<=n;i++) if( !p[i] ) ++no, sterge(i);
fout<<no;
return 0;
}