Cod sursa(job #871188)

Utilizator roxannemafteiuMafteiu-Scai Roxana roxannemafteiu Data 4 februarie 2013 16:09:33
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <stdio.h>
#include <math.h>
FILE *in,*out;
int N,i,j,c[100001],cnt;
using namespace std;
int main()
{
    in=fopen("ciur.in","rt");
    out=fopen("ciur.out","wt");
    fscanf(in,"%d",&N);
    double x=sqrt(N);
    for(i=2;i<=N; i++)
         c[i]=1;
      for(i=2;i<=N;i++)
          if (c[i])
           {
           ++cnt;
               for (j=i+i; j<=N; j+=i)
                   c[j]=0;
           }




       fprintf(out,"%d", cnt);
    fclose(in);
    fclose(out);
    return 0;
}