Cod sursa(job #1005675)

Utilizator teodor98Teodor Sz teodor98 Data 5 octombrie 2013 14:52:09
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.35 kb
#include <fstream>
#include <math.h>

using namespace std;

int main() {
ifstream fin;
ofstream fout;
fin.open("ciur.in");
fout.open("ciur.out");
bool a[2000001];
int nr=0, n, i, j;
fin>>n;
for (i=2;i<=n;i++)
  a[i]=1;
for (i=2;i<=sqrt(n);i++)
 if (a[i])
  for (j=i;j<=n/i;j++)
     a[i*j]=0;
for (i=2;i<=n;i++)
  if (a[i]) nr++;
fout<<nr;
fout.close();
retur