Cod sursa(job #2058545)
Utilizator | Data | 5 noiembrie 2017 19:18:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
using namespace std;
int MAX=1000000;
long p[1000001];
void ciur()
{
long i,j;
p[1]=1;
for(i=2;i*i<=MAX;i++)
{
if(p[i]==0)
{
for(j=2;j<=MAX/i;j++)
p[i*j]=1;
}
}
}
int main()
{
long n,nr=0,i;
ciur();
cin>>n;
nr++;
for(i=3;i<=n;i++)
{
if(p[i]==0)
nr++;
}
cout<<nr;
return 0;
}