Cod sursa(job #1037445)

Utilizator 0051David Sera 0051 Data 20 noiembrie 2013 11:32:05
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include <fstream>
#include <iostream>

using namespace std;

ifstream fin("ciur.in");
ofstream fout("ciur.out");

#define MAX 2000000

bool a[MAX+9];

int main()
{
    int n,i,j,k;
    a[0]=a[1]=1;
    fin>>n;
    k=0;
    for(i=2;i<MAX;i++)
        if(n){
            if(!a[i]){
                for(j=i*i;j<=MAX;j+=i)
                    a[j]=1;
                k++;
            }
            n--;
    }
    fout<<k-1;
    return 0;
}