Cod sursa(job #2359433)
Utilizator | Data | 28 februarie 2019 20:43:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
bool n,v[2000001],nr;
//
int main()
{
cin>>n;
v[1]=1;
for(int i=2;i<=2000000;++i)
if(v[i]==0)
for(int j=2*i;j<=2000000;j=j+i)
{
v[j]=1;
}
for(int i=1;i<=n;++i)if(v[i]==0)nr++;
cout<<nr<<'\n';
return 0;
}