Cod sursa(job #2927774)
Utilizator | Data | 21 octombrie 2022 15:19:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
const int N=2e6+3;
bool ciur[N];
int main()
{
int n,nr=0,c;
cin>>n;
ciur[1]=1;
for(int i=2; i*i<=n; i++)
if(ciur[i]==0)
for(int j=2; j*i<=n; j++)
ciur[i*j]=1;
for(int i=2; i<=n; i++)
if(ciur[i]==0)
nr++;
cout<<nr;
return 0;
}