Cod sursa(job #1179657)

Utilizator Balescu_OvidiuBalescu Ovidiu-Gheorghe Balescu_Ovidiu Data 28 aprilie 2014 23:52:45
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include<stdio.h>
unsigned long n,j,i,q=1; bool a[2000000];
int main()
{
    FILE*f=fopen("ciur.in", "r");
    fscanf(f,"%lu",&n); 
    FILE*g=fopen("ciur.out","w");
	if(n%2==0) n--;
    for(i=3;i<=n;i+=2)
        if(a[i]==0)
        {
            for(j=3;j<=n;j+=2) a[j*i]=1;
            q++;
        }
    fprintf(g,"%lu",q);
	fclose(f);
    fclose(g);
    return 0;
}