Cod sursa(job #185692)
Utilizator | Data | 25 aprilie 2008 20:53:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
using namespace std;
long long unsigned a[2000005];
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int main ()
{
int n,i,j,k;
fin>>n;
k=0;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=n;i++)
{
if(a[i]==1)
{
k++;
for(j=i;j<=n;j+=i)
a[j]=0;
}
}
fout<<k;
return 0;
}