Cod sursa(job #2083400)
Utilizator | Data | 7 decembrie 2017 17:52:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#define MAX 2000001
using namespace std;
ifstream inf("ciur.in");
ofstream outf("ciur.out");
bool e_multiplu[MAX];
int main()
{
int n, nr = 0; inf >> n;
for(int i = 2; i <= n; i++)
{
if(e_multiplu[i]) continue;
for(int j = i * i; j <= n; j += i)
{
e_multiplu[j] = true;
}
nr++;
}
outf << nr;
}