Pagini recente » Cod sursa (job #1244036) | Cod sursa (job #767412) | Cod sursa (job #776700) | Cod sursa (job #2250052) | Cod sursa (job #2077685)
#include <bits/stdc++.h>
using namespace std;
bitset<2000001> a;
int main()
{
int i,j,n,cnt;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
a[0]=a[1];
for(i=4;i<=n;i+=2)
a[i]=1;
for(i=3;i*i<=n;i+=2)
if(a[i]==0) ///i- prim si marchez multiplii cu 1
for(j=i*i;j<=n;j+=(2*i))
a[j]=1;
cnt=0;
for(i=2;i<=n;i++)
if(a[i]==0) cnt++;
cout<<cnt<<"\n";
fout.close();
return 0;
}