Cod sursa(job #1027734)

Utilizator laszloasandorLaszlo Sandor laszloasandor Data 12 noiembrie 2013 23:27:16
Problema Ciurul lui Eratosthenes Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include "stdio.h"
#include "math.h"

#define fr(i,a,b) for(int i=a;i<b;++i)
#define N 2000000

bool t[N]={0};

int main()
{
    long n;
    int h=0;
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%ld",&n);
    fr(i,2,sqrt(n))
    {
        for(int j=i*i;j<n;j+=i)
            t[j]=true;
    }
    fr(i,2,n)
        if(!t[i]) ++h;
    printf("%d",h);
    return 0;
}