Cod sursa(job #2084643)

Utilizator Cpt.TropicalOlaru Valentin Alexandru Cpt.Tropical Data 9 decembrie 2017 11:13:39
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");


int main() {
int a[2000000];
int nr = 0, n, i, j;

fin >> n;
if(n>=2 && n<=2000000){
for (i = 2; i <= n; i++)
a[i] = 1;
for (i = 2; i <= sqrt(n); i++)
if (a[i] != 0)
for (j = 2; j <= n / i; j++)
a[i*j] = 0;
for (i = 2; i <= n; i++)
if (a[i] != 0)
nr++;
fout << nr << endl;
}
return 0;
}