Pagini recente » Cod sursa (job #398393) | Cod sursa (job #280453) | Cod sursa (job #350296) | Cod sursa (job #1861173) | Cod sursa (job #546306)
Cod sursa(job #546306)
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
vector<bool> sir;
void mark(int i, int n)
{
int j = i * i;
while(j<=n)
{
sir[j] = 0;
j += i;
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
scanf("%d",&n);
sir.resize(n+5,1);
int i=2;
int k=sqrt(n);
while(i<=k)
{
if(sir[i] == 1)
mark(i,n);
i++;
}
int count = 0;
for(int i=2;i<=n;i++)
count += sir[i];
printf("%d\n",count);
}