Cod sursa(job #2650895)
Utilizator | Data | 20 septembrie 2020 18:42:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
bool c[1000001];
int x = 1000001;
int p;
void ciur()
{
c[1]=c[0]=1;
for(int i = 2 ; i * i <= x ; ++i)
for(int j = 2 ; i * j <= x ; ++j)
c[i*j]=1;
}
int main()
{
int n;
cin >> n;
ciur();
for(int i = 1 ; i <= n ; ++i)
if(c[i]==0)
p++;
cout<<p;
return 0;
}