Cod sursa(job #720385)

Utilizator desoComan Andrei deso Data 22 martie 2012 16:57:05
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <cstdlib>
#include <string>
using namespace std;

#define LL long long
#define INFILE "ciur.in" 
#define OUTFILE "ciur.out"
#define NMAX 2000010

bool v[NMAX];

int main()
{
   freopen(INFILE, "r", stdin);
   freopen(OUTFILE, "w", stdout);
   int n, primes = 0;
   cin >> n;

   memset(v, 0, sizeof(v));
   for(int i=2; i<=n; i++)
      if( !v[i] )
      {
         primes++;
         for(int j = i; j<=n; j+=i)
            v[j] = 1;
      }
   cout << primes;

   return 0;
}