Cod sursa(job #2834731)
| Utilizator | Data | 17 ianuarie 2022 16:23:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
const int NMAX = 2e6;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[NMAX];
int n,c=0;
int main()
{
fin >> n;
for(int i=2;i<=n;i++)
ciur[i]= 0;
ciur[2]=0;
for(int i=2;i<=n;++i)
{for (int j = 2; i * j <= n; j++) {
ciur[i * j] = 1;
}}
if(n>=2)
c++;
for(int i=3;i<=n;i+=2)
if(!ciur[i])
c++;
fout<<c;
return 0;
}
