Cod sursa(job #2751796)
Utilizator | Data | 15 mai 2021 20:33:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
using namespace std;
/*ifstream fin("ciur.in");
ofstream fout("ciur.out");*/
bool ciur[2000001];
int main()
{
ciur[0]=ciur[1]=1;
for(int i=2; i*i<=2000000; i++) {
if(ciur[i]==0) {
for(int j=i*i; j<=2000000; j+=i)
ciur[j]=1;
}
}
int nr=0,n;
cin>>n;
for(int i=2;i<=n;i++){
if(ciur[i]==0)
nr++;
}
cout<<nr;
return 0;
}