Cod sursa(job #2073315)

Utilizator eduardandrei20Nechifor Eduard Andrei eduardandrei20 Data 22 noiembrie 2017 22:23:43
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.47 kb
#include <iostream>
#include <stdio.h>
using namespace std;

bool prime[2000001];
int cnt;

int main()
{
    int n ;
    freopen("ciur.in","r",stdin);
    scanf("%d",&n);

    for(int i = 2 ; i <= n ; ++ i )prime[i]=true;

    for(int i = 2;  i <=n ; ++ i )
        if(prime[i])
        {++cnt;
         for( int j = i + i ; j <= n ; j += i )
            prime[j]=false;
        }
freopen("ciur.out","w",stdout);
printf("%d",cnt);



    return 0;
}