Pagini recente » Cod sursa (job #1334117) | Diferente pentru problema/kfib intre reviziile 34 si 35 | Borderou de evaluare (job #859821) | Cod sursa (job #3157970) | Cod sursa (job #2418987)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
vector <bool> x;
long long i,j,n;
int main()
{
cin>>n;
if (n==1) cout<<"0";
else
{
x.resize(n+1);
x[0]=false;
x[1]=false;
for (i=2;i<=n;++i) x[i]=true;
for (i=2;i*i<=n;++i)
{
j=i;
if (x[i])
{
while (j<=n)
{
j+=i;
x[j]=false;
}
}
}
int db;
db=0;
for (i=2;i<=n;++i) if (x[i]==true) db++;
cout<<db;
}
return 0;
}