Pagini recente » Cod sursa (job #1802244) | Cod sursa (job #219100) | Cod sursa (job #2053022) | Cod sursa (job #2886470) | Cod sursa (job #1199793)
#include <cstdio>
using namespace std;
#define MAX 2000003
int ciur[MAX], n;
int fciur();
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
printf("%d\n",fciur());
}
int fciur()
{
int i, j, sol=0;
for(i=4; i<=n; i+=2)
ciur[i]=1;
for(i=2; i<=n; i++){
if(ciur[i]==0){
for(j=i*i; j<=n; j+=i)
ciur[j]=1;
sol++;
}
}
/*for(i=2; i<=n; i++)
if(ciur[i]==0)
printf("%d ",i);*/
return sol;
}