Cod sursa(job #2751812)
| Utilizator | Data | 15 mai 2021 21:06:39 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
const int N=2000000;
bool ciur[N+1];
int main()
{
ciur[0]=ciur[1]=1;
for(int i=4; i<=N; i+=2)
ciur[i]=1;
for(int i=3; i*i<=N; i+=2)
if(ciur[i]==0)
for(int j=i*i; j<=N; j+=2*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;
}
