Cod sursa(job #3330087)
| Utilizator | Data | 17 decembrie 2025 14:58:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int NMAX=2000001;
bool v[NMAX];
int c;
void ciur(int n)
{
v[0]=v[1]=1;
for(int i=4 ; i<=n ; i+=2)
v[i]=1;
for(int i=3 ; i*i<=n ; i+=2)
{
if(v[i]==0)
for(int j=i*i ; j<=n ; j+=i)
v[j]=1;
}
for(int i=1; i<=n; i++)
if(v[i]==0)
c++;
}
int main()
{
int n;
f>>n;
ciur(n);
g<<c;
f.close();
g.close();
return 0;
}
