Pagini recente » Cod sursa (job #646019) | Cod sursa (job #2864366) | Cod sursa (job #1150326) | Cod sursa (job #2931957) | Cod sursa (job #1285075)
#include <bits/stdc++.h>
using namespace std;
int Ld[2000013],Q[150013],sol(0),n,sf(0);
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for (int i=2;i<=n;++i)
{
if (Ld[i]==0)
{
Ld[i]=i;
Q[++sf]=i;
}
for (int j=1;j<=sf && i*Q[j]<=n && Q[j]<=Ld[i] ; ++j)
Ld[i*Q[j]]=Q[j];
}
for (int i=2;i<=n;++i)
if (Ld[i]==i) ++sol;
cout<<sol;
return 0;
}