Cod sursa(job #1772079)

Utilizator iAnduAlexandru Banu iAndu Data 6 octombrie 2016 14:50:29
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <stdio.h>
#include <fstream>
#include <math.h>
#define lim 2000000

bool v[lim];

int main() {
	int n, i, j, nr = 1;
	
	ifstream in("ciur.in");
	ofstream out("ciur.out");
	
	in >> n;
	for (i = 3; i <= (int)(sqrt((double)n)); i = i + 2)
		for (j = i * i; j <= n; j = j * i)
			v[i] = true;
	for (i = 3; i <= n; i = i + 2)
		if (v[i] == false)
			nr++;
	out << nr << '\n';

	in.close();
	out.close();
	return 0;
}