Cod sursa(job #343856)
Utilizator | Data | 27 august 2009 16:06:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
long int p[2000000],nr;
int main()
{
long int i,j,n;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{
if(p[i]==0)
{
nr++;
for(j=2*i;j<=n;j+=i)
p[j]=1;
}
}
g<<nr<<"\n";
f.close();
g.close();
return 0;
}