Cod sursa(job #1342636)

Utilizator tiberiumunteanMuntean Tiberiu tiberiumuntean Data 14 februarie 2015 12:45:49
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.37 kb
#include <fstream>
#define N 2000001
using namespace std;

int main()
{
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
  bool ciur[N];
int i;
  for(i=1;i<=N-1;i++)
    ciur[i]=true;
  int n,j,cnt=0;
  fin>>n;
  for(i=2;i<=n;i++)
   if(ciur[i]==1)
   {cnt++;
       for(j=i+i;j<=n;j=i+i)
   ciur[j]=false;
   }

   fout<<cnt;

    return 0;
}