Cod sursa(job #167895)
Utilizator | Data | 30 martie 2008 12:46:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
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 a[2000000];
int main()
{
int n,i,j,gh,k;
fin>>n;
for(i=2;i<=n;++i)
{
if(a[i]==0)
{
++gh;
k=2;
j=i*k;
while(j<=n)
{
a[j]=1;
++k;
j=i*k;
}
}
}
fout<<gh;
return 0;
}