Cod sursa(job #2675058)
Utilizator | Data | 21 noiembrie 2020 09:46:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int main()
{
int n,nr=0;
cin>>n;
bool notprime[n];
for(int div=2;div<n;div++)
{
if(notprime[div])
{
continue;
}
for(int i=2*div;i<=n;i+=div)
{
notprime[i]=true;
}
}
nr=0;
for(int i=0;i<n;i++)
{
if(notprime[i]==false) nr++;
}
cout<<nr;
return 0;
}