Cod sursa(job #145148)
Utilizator | Data | 28 februarie 2008 15:03:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int a[2000005], N, cates,i,j;
int main(){
ifstream f("ciur.in");
f>>N;
f.close();
a[0]=a[1]=1;
for(i=3; i*i<=N;i++)
if(a[i]==0){cates++;
for(j=i*i;j<=N;j++)
a[j]=1;}
ofstream g("ciur.out");
g<<cates<<'\n';
for(i=2;i<=N&&i<1002;i++)
if(!a[i]) g<<i<<' ';
g<<'\n';
g.close();
return 0;
}