Cod sursa(job #1542182)

Utilizator Fanika123Tanasa Stefan Fanika123 Data 5 decembrie 2015 09:01:17
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <fstream>
#define N 1000001
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool a[N];
int prim[N];
int n;
int main()
{
    cin>>n;
    for (int i=4;i<=n;i+=2) a[i]=1; ///toate numerele pare cu exceptia lui 2

    for (int i=3;i*i<=n;i+=2)
        if (a[i]==0)
          for (int j=i*i;j<=n;j=j+2*i)
             a[j]=1;
    int k=0;
    prim[++k]=2;
    for (int i=3;i<=n;i+=2)
          if (a[i]==0) prim[++k]=i;

    for (int i=1;i<=k;++i)
         cout<<prim[i]<<" ";
    cin.close();
    cout.close();
    return 0;

}