Cod sursa(job #157061)
Utilizator | Data | 12 martie 2008 20:50:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
int x[200001],i,j,k,l,m,n;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{if(i>n)break;
if(x[i]==0)
k++;
for(j=i*2;j<=n;j+=i)
{if(j>n)
break;
x[j]=1;}
}
g<<k;
f.close();
g.close();
return 0;
}