Cod sursa(job #3123192)
Utilizator | Data | 22 aprilie 2023 14:02:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
using namespace std;
int eratostene[2000001];
int main()
{
int n,nr=0;
cin>>n;
for(int div=2;div*div<=n;div++)
{
if(eratostene[div]==1)
{
continue;
}
for(int mult=div*2;mult<=n;mult+=div)
{
eratostene[mult]=1;
}
}
for(int i=2;i<=n;i++)
{
if(eratostene[i]==0)
nr++;
}
cout<<nr;
}