Cod sursa(job #1239109)
Utilizator | Data | 8 octombrie 2014 11:26:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool c[200000001];
int main()
{
int n, i, j, nr = 0;
in >> n;
for (i = 2; i*i <= n; i++)
if (!c[i])
for (j = i*i; j <= n; j+=i)
c[j] = true;
for (i = 2; i <= n; i++)
if (!c[i])
nr++;
out << nr;
return 0;
}