Cod sursa(job #2858326)
| Utilizator | Data | 27 februarie 2022 13:01:03 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
bool v[20000001];
int main()
{
int n,j,i,x=0;
cin>>n;
for(i=2;i*i<=n;i++)
{
if(v[i]==0)
for(j=i*2;j<=n;j=j+i)
{
v[j]=1;
}
}
for(i=2;i<=n;i++)
if(v[i]==0)
x++;
cout<<x;
return 0;
}
