Cod sursa(job #271134)

Utilizator pedobearBacauanu Vlad pedobear Data 4 martie 2009 22:13:38
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include <stdio.h>

int i,n,j,count;
int v[2000001];

int main ()
{
    freopen ("ciur.in","r",stdin);
    freopen ("ciur.out","w",stdout);
    
    scanf ("%d",&n);
    
    for (i=2;i*i<=n;i++)
        if (v[i]==0) for (j=i*i;j<=n;j=j+i) v[j]=1;
    
    for (i=2;i<=n;i++) if (v[i]==0) count++;
                   
    printf ("%d",count);
    
    return 0;
}