Cod sursa(job #898674)

Utilizator ocolisanrvocolisan ocolisanrv Data 28 februarie 2013 11:19:45
Problema Ciurul lui Eratosthenes Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include<stdio.h>
FILE *in,*out;
int i,n,j,kontor;
bool ciur[1000001];
int main()
{
    in=fopen("ciur.in","rt");
    out=fopen("ciur.out","wt");
    fscanf(in,"%d",&n);
    for(i=2;i<=n;i++)
        ciur[i]=true;
    for(i=2;i*i<=n;i++)
    {
        if(ciur[i])
        {
            for(j=i*i;j<=n;j+=i)
            {
                ciur[j]=false;
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(ciur[i])
            kontor++;
    }
    fprintf(out,"%d",kontor);
    fclose(in);
    fclose(out);
    return 0;
}