Cod sursa(job #1718729)

Utilizator Gigel-FroneGigel Fronel Gigel-Frone Data 18 iunie 2016 21:59:46
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.45 kb
#include <stdio.h>

using namespace std;

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

    int n;
    scanf("%d", &n);

    bool *v;
    v=new bool [n];
    for(int i=2; i<=n; i++) v[i]=1;

    int k=0;
    for(int i=2; i*i<=n; i++)
        if(v[i])
    {
        for(long long j=i*2; j<=n; j+=i)
            v[j]=0;
    }
    for(int i=2; i<=n; i++) if(v[i]==1) k++;
    printf("%d\n", k);
}