Cod sursa(job #2046764)
| Utilizator | Data | 24 octombrie 2017 09:10:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
using namespace std;
int n,i,j,nr;
bool ok[2000003];
int main()
{cin>>n;
for(i=2;i<=n;i++)
ok[i]=true;
for(i=2;i*i<=n;i++)
{
if(ok[i]=true)
{
for(j=i*2;j<=n;j+=i)
ok[j]=false;
}
}
for(i=2;i<=n;i++)
if(ok[i]==true) nr++;
cout<<nr;
return 0;
}
