Cod sursa(job #1463300)

Utilizator StefanMudragMudrag Stefan StefanMudrag Data 20 iulie 2015 17:48:14
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include<stdio.h>
#define NMAX 2000005
FILE *fin,*fout;
int n,ciur[NMAX],nr=0;
void read()
{
    fin=fopen("ciur.in","r");
    fscanf(fin,"%d",&n);
    fclose(fin);
}
void solve()
{
    for(int i=2;i<=n;i++) ciur[i]=1;
    for(int i=2;i<=n;i++)
    {
        if(ciur[i])
            {   nr++;
                for(int j=i+i;j<=n;j=j+i)
               ciur[j]=0;}
    }
}
void afisare()
{  //int nr=0;
    fout=fopen("ciur.out","w");

   fprintf(fout,"%d",nr);
   fclose(fout);
}
int main()
{
   read();
   solve();
   afisare();
   return 0;
}