Cod sursa(job #255980)
Utilizator | Data | 10 februarie 2009 21:59:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
char ciur[2000005];
int main()
{
long n,i,j,rez=0;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2;i*i<=n;i++)
if(!ciur[i])
{
rez++;
for(j=2;j*i<=n;j++)
ciur[i*j]=1;
}
out<<rez<<'\n';
}