Cod sursa(job #3371171)
| Utilizator | Data | 28 octombrie 2026 21:24:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=2000000;
bool v[NMAX +1];
ifstream f("erastotene.in");
ofstream g("erastotene.out");
int ciur(int n)
{
long long i,j,nr=1;
v[0]=v[1]=1;
for(i=4;i<=n;i+=2)
v[i]=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
{
nr++;
for(j=i*i;j<=n;j+=2*i)
v[j]=1;
}
return nr;
}
int main()
{
int n;
cin>>n;
cout<<ciur(n);
}
