Cod sursa(job #3299890)
Utilizator | Data | 11 iunie 2025 14:44:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
const int nmax=2e6;
bool ciur[nmax+5];
void eratostene ()
{
ciur[0]=ciur[1]=true;
for (int i=2; i<=nmax; i++)
{
if (!ciur[i])
{
for (int j=2*i; j<=nmax; j+=i)
ciur[j]=true;
}
}
}
signed main ()
{
eratostene();
int n;
fin >> n;
int rez=0;
for (int i=2; i<=n; i++)
{
if (!ciur[i])
rez++;
}
fout << rez;
return 0;
}