Cod sursa(job #1809685)

Utilizator SolcanMihaiSolcan Mihai Andrei SolcanMihai Data 19 noiembrie 2016 10:12:57
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <math.h>

using namespace std;

bool a[60000000];
int n;

int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);

    scanf("%d", &n);

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

    int nr = 0;

    for(int i = 2; i < n; i++)
    {
        if(a[i]!=1)
        {
            nr++;
        }
    }

    printf("%d", nr);

    return 0;
}