Cod sursa(job #2464877)

Utilizator DanDumitrescudarkeagle DanDumitrescu Data 29 septembrie 2019 00:23:35
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.48 kb
#include <iostream>
#include <cstdio>
#include<cmath>
#define nmax 20007
FILE * f=fopen("ciur.in","r");
FILE * g=fopen("ciur.out","w");
using namespace std;
int n,v[nmax];
int main()
{  int i,j,nr=0;

    fscanf(f,"%d",&n);
  for(i=2;i<=nmax;i++)
  {
      v[i]=1;
  }
  for(i=2;i*i<=n;i++)
    if(v[i])
    for(j=2;j*i<=n;j++)
    v[i*j]=0;
    int ok=1;
  for(i=2;i<=n && ok==1;i++)
  {
       if(v[i]==1)
        nr++;
  }
  fprintf(g,"%d",nr);
    return 0;
}