Cod sursa(job #1044374)

Utilizator hevelebalazshevele balazs hevelebalazs Data 29 noiembrie 2013 18:31:20
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <stdio.h>
#include <math.h>
#define N 2000000
bool a[N+1];
int main(){
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    int n,s=1;
    scanf("%i",&n);
    int sqrtn=sqrt(n);
    for(int i=3;i<=sqrtn;i+=2){
        if(!a[i]){
            int i2=i<<1;
            for(int j=i+i2;j<=n;j+=i2)a[j]=true;
            }
        }
    for(int i=3;i<=n;i+=2)s+=!a[i];
    printf("%i",s);
    return 0;
    }