Cod sursa(job #2472935)
Utilizator | Data | 13 octombrie 2019 11:22:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void ciur();
int n, nrprime;
bool p[2000005];
int prime[150000];
int main()
{
fin >> n;
ciur();
fout << nrprime;
return 0;
}
void ciur()
{
int i, j;
for (i = 2; i <= n; i++)
if (!p[i])
{
prime[++nrprime] = i;
for (j = i; j <= n; j += i)
p[j] = 1;
}
}