Pagini recente » Borderou de evaluare (job #1321860) | Borderou de evaluare (job #1321839) | Diferente pentru problema/dlog intre reviziile 2 si 3 | Cod sursa (job #855654) | Cod sursa (job #2191981)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bitset<2000000>ap;
int main()
{
fin>>n;
int p=sqrt(n);
for(int i=2;i<=p;i++)
{
if(ap[i]==0)
{
for(int j=2*i;j<=n;j+=i)
ap[j]=1;
}
}
int counter=0;
for(int i=2;i<=n;i++)
if(ap[i]==0)
counter++;
fout<<counter;
return 0;
}