Cod sursa(job #2357063)
| Utilizator | Data | 27 februarie 2019 09:16:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
const int VM = 2000001;
bool c[VM];
int main()
{
int n;
cin>>n;
for(int i=2; i*i<VM; i++)
{
if(!c[VM])
{
for(int j=i*i; j<VM; j+=i)
{
c[j]=true;
}
}
}
int nr=0;
for(int i=2; i<=n; i++)
{
if(!c[i])
nr++;
}
cout<<nr;
return 0;
}
