Cod sursa(job #144572)
Utilizator | Data | 27 februarie 2008 19:42:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
#define MAX 1024
int main()
{ int ciur[MAX],n,i,j,s=0;
f>>n;
for(i=2;i<n;i++)
ciur[i]=1;
for(i=2;i*i<=n;i++)
if(ciur[i])
for(j=2;j*i<n;j++)
ciur[i*j]=0;
for(i=2;i<n;i++)
{ if(ciur[i]) s+=ciur[i]; }
g<<s<<"\n";
for(i=2;i<n;i++)
if(ciur[i])
g<<i<<' ';
return 0;
}