Cod sursa(job #1959562)

Utilizator VarticeanNicolae Varticean Varticean Data 9 aprilie 2017 17:21:18
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include <iostream>
#include <fstream>

using namespace std;

long int ciur(long int n){

 bool a[n];

 long int k=0;

for(long int i=2; i<=n; i++){
    a[i]=true;
}

 for(long int i=2; i<=n; i++){
    if ( a[i]==true )
        for(long int j=2*i; j<=n; j+=i)
            a[j]=false;
            if ( i*i>n ) break;
 }

 for(long int i=2; i<=n; i++)
    if (a[i]==true) k++;

return k ;
}
int main()
{
    ifstream in("ciur.in");
    ofstream out("ciur.out");
long int n;

   in>>n;
   out<<ciur(n);

    return 0;
}