Cod sursa(job #2842993)
Utilizator | Data | 1 februarie 2022 20:18:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
const int NMAX=2000001;
bool ciur[NMAX];
int n,nr;
int main()
{
cin>>n;
ciur[1]=1;
ciur[0]=1;
for(int i=2;i<=n;i++)
if(ciur[i]==0){
for(int j=i*2;j<=n;j=j+i)
ciur[j]=1;
nr++;
}
cout<<nr;
return 0;
}