Cod sursa(job #1219326)

Utilizator sabauandrei98Sabau Andrei sabauandrei98 Data 13 august 2014 23:29:16
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include <iostream>
#include <limits.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <utility>
#include <fstream>
using namespace std;

ifstream f("ciur.in");
ofstream g("ciur.out");

#define mp make_pair
#define pb push_back
#define ff first
#define ss second

int n,k=0,i,j,a[2000001];

int main()
{
   f>>n;
   for(i=2; i<=n; i++)
        if (a[i]==0)
            for(j=2; j<=n/i; j++)
                a[i*j]=1;

   for(i=2; i<=n; i++)
        if (a[i]==0) k+=1;

   g<<k<<endl;

   return 0;
}