Cod sursa(job #1689591)
Utilizator | Data | 14 aprilie 2016 13:15:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000005];
int main()
{
int n, nr = 0, i, j;
f >> n;
for (i = 2; i <= n; i++)
if (ciur[i] == 0)
{
nr++;
for (j = i+i; j <= n; j += i)
ciur[j] = 1;
}
g << nr;
return 0;
}