Cod sursa(job #1483847)

Utilizator sab-cNibas B36 sab-c Data 9 septembrie 2015 23:43:56
Problema Ciurul lui Eratosthenes Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
#include <fstream>
using namespace std;
 int main()
 {
     long int n,k=0;
   bool a[2000000];

    ifstream fi("ciur.in");
     ofstream fo("ciur.out");
     fi>>n;
     for (int i=0;i<n;i++)
     {
         a[i]=true;
     }
    for (int i=2;i<=n;i++)
    if (a[i]){
             for(int j=2;j<=n/i;j++)
              a[i*j]=false;


               }
for (int i=2;i<=n;i++)
 if ((a[i]==true)){ k++;}
 fo<<k;
  fi.close();fo.close();
 return 0;
 }