Cod sursa(job #1653095)
Utilizator | Data | 15 martie 2016 18:46:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void ciur();
bool P[2000005];
int n, nr;
int main()
{
int i;
fin >> n;
ciur();
fout << nr << '\n';
return 0;
}
void ciur()
{
long long i, j;
nr++;
for (i = 2; i <= n; i += 2)
P[i] = 1;
for (i = 3; i <= n;i+=2)
if (!P[i])
{
nr++;
for (j = i*i; j <= n; j += i)
P[j] = 1;
}
}