Cod sursa(job #148748)
Utilizator | Data | 4 martie 2008 19:46:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream.h>
#define NMax 10000
int main()
{
int ciur[NMax],n,i,j;
cout<<"n= ";
cin>>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])
cout<<i<<' ';
return 0;
}