Cod sursa(job #1933625)
Utilizator | Data | 20 martie 2017 20:40:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
using namespace std;
#define NMAX 5000
int main()
{
int n, prim[NMAX];
cin >> n;
for( int i = 2; i <= n; i++)
prim[i] = 0;
for( int i = 2; i <= n; i++)
if( prim[i] == 0 )
for( int j = 2; i*j <= n; j++ )
prim[i*j] = 1;
for( int g = 2; g <= n; g++ )
if( prim[g] == 0)
cout<< g << ' ';
return 0;
}