Cod sursa(job #1096077)

Utilizator demetriad-dagpagDavid Demetriad demetriad-dagpag Data 1 februarie 2014 15:07:46
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.46 kb
#include <stdio.h>
#include <stdlib.h>
char ciur[2000000];
int main()
{
    int n,i,c=0,j;
    FILE *fin=fopen("ciur.in","r");
    FILE *fout=fopen("ciur.out","w");
    fscanf(fin,"%d",&n);
    //scanf("%d",&n);
    for(i=1; ((i<<1)+1)<=n; i++)
        if(ciur[i]==0){
            c++;
            for(j=((i<<1)+1); (j<<1)+1<=n; j+=((i<<1)+1)<<1)
                ciur[j]=1;
        }
    //printf("%d",c+1);
    fprintf(fout,"%d",c+1);

    return 0;
}