Cod sursa(job #1692341)

Utilizator PopoviciRobertPopovici Robert PopoviciRobert Data 20 aprilie 2016 18:30:41
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <cstdio>
#define MAXN 2000000
char ciur[MAXN+1];
int main(){
    FILE*fi,*fout;
    int i,j,n,con;
    fi=fopen("ciur.in" ,"r");
    fout=fopen("ciur.out" ,"w");
    fscanf(fi,"%d" ,&n);
    for(i=2;i*i<=n;i++)
      if(ciur[i]==0)
        for(j=i*i;j<=n;j+=i)
          ciur[j]=1;
    con=0;
    for(i=2;i<=n;i++)
      if(ciur[i]==0)
        con++;
    fprintf(fout,"%d" ,con);
    fclose(fi);
    fclose(fout);
    return 0;
}