Cod sursa(job #186295)
Utilizator | Data | 27 aprilie 2008 13:17:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
using namespace std;
char 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;
}