Cod sursa(job #1112510)

Utilizator george.harigaGeorge Hariga george.hariga Data 19 februarie 2014 20:05:23
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include <fstream>
#define max 2000000
#define max2 45000
#include <bitset>

using namespace std;

int main()
{
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
    bitset<max>v;
    int prim[max2];
    int n,i,j,k=0;
    prim[0]=2;
    fin>>n;
    for(i=4;i<=n;i+=2)
        v[i]=1;
    for(i=3;i<=n;i+=2)
        if(v[i]==0)
        {
            prim[++k]=i;
            for(j=i*i;j<=max;j=j+2*i)
                v[j]=1;
        }
    for(i=0;i<=k;i++)
        fout<<prim[i]<<"\n";
    return 0;
}