Cod sursa(job #2277539)

Utilizator mihai123451234MihaiPintilie mihai123451234 Data 6 noiembrie 2018 15:18:06
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.55 kb
#include <iostream>
#include <vector>
#include <bitset>
#include <fstream>
#define LL long long
#define Nmax 2000005


using namespace std;
vector <int> pr;
bitset <Nmax> isprime;
ifstream fin ("ciur.in")
ofstream fout ("ciur.out")
int N;
void ciur()
{
    for(int LL i=2;i<=Nmax;i++)
    {
        if(isprime[i]==0)
        {
        for(j=i;j<=Nmax;j+=i)
            isprime[j]=1;
        }
       pr.push_back (i);
    }
}

int main()
{
    int N,i;
  cin>>N;
  ciur()
  for(i=2;pr[i]<=Nmax;i++)
    cout<<pr[i];
    return 0;
}