Cod sursa(job #1317807)
Utilizator | Data | 15 ianuarie 2015 10:52:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <iostream>
#define NMAX 1000
using namespace std;
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;
}