Cod sursa(job #694242)

Utilizator wizekidNeagu Gabriel wizekid Data 27 februarie 2012 19:29:06
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.36 kb
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, nr;
char prim[2000005];
int main(void)
{   int i, j;
	f>>n;
    for (i = 2; i <= n; ++i)
        prim[i] = 1;
    for (i = 2; i <= n; ++i)
        if (prim[i])
        {++nr;
		 for (j = i+i; j <= n; j += i) prim[j] = 0;
        }
    printf("%d\n",nr);
    return 0;
}