Cod sursa(job #548526)
Utilizator | Data | 7 martie 2011 15:24:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
char a[200009];
long long n,i,j;
int main()
{
ifstream f;
f.open("ciur.in");
ofstream g;
g.open("ciur.out");
f>>n;
for(i=1;i<=n;i++)
a[i]=1;
int k=0;
for(i=2;i<=n;i++)
if(a[i]==1)
{
for( j=i;j<=n;j=j+i)
a[j]=0;
k++;
}
//cout<<k;
g<<k;
f.close();
g.close();
return 0;
}