Cod sursa(job #1928100)
Utilizator | Data | 15 martie 2017 20:51:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
bool prim[2000002], nr;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int i, j, n;
f >> n;
for (i = 2; i <= n; ++ i)
if (!prim[i])
{
++nr;
for (j=i+i; j <= n; j+=i)
prim[j]=1;
}
g << nr;
return 0;
}