Cod sursa(job #532304)

Utilizator nahsucpasat cristian nahsuc Data 11 februarie 2011 12:23:35
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.39 kb
#include<stdio.h>
#define max 2000000
FILE *in=fopen("ciur.in","rt");
FILE *out=fopen("ciur.out","wt");
int j,i,n,prim[max],cont;

int main()
{
    fscanf(in,"%d",&n);
    for(i=2;i<=n;i++)
    if(prim[i]==0)
    {
        for(j=i*2;j<=n;j+=i)
            prim[j]=1;
    }
    for(i=2;i<=n;i++)
        if(prim[i]==0)
            cont++;
    fprintf(out,"%d",cont);
    return 0;
}