Cod sursa(job #152373)
Utilizator | Data | 9 martie 2008 13:35:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
#define nmax 2000001
char nr[nmax];
long long i,n,j,x[1002],p=0;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++) nr[i]=1;
for(i=2;i<=n;i++)
for(j=i+i;j<=n;j+=i)
if(nr[j]!=0)
nr[j]=0;
for(i=2;i<=n;i++)
if(nr[i]==1)
x[p++]=i;
g<<p<<"\n";
for(i=0;i<p-1;i++)
g<<x[i]<<" ";
g<<x[i];
return 0;
}