Cod sursa(job #2123763)
Utilizator | Data | 6 februarie 2018 16:47:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
bool v[2000005];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin >> n;
int i, j;
for (i = 2; i <= n; i++)
if (v[i] == 0)
for (j = 2 * i; j <= n; j = j + i)
v[j] = 1;
int nr = 0;
for (i = 2; i <= n; i++)
if (v[i] == 0)
nr++;
fout << nr;
return 0;
}