Pagini recente » Cod sursa (job #2305641) | Cod sursa (job #1349001) | Cod sursa (job #34462) | Cod sursa (job #2156655) | Cod sursa (job #216509)
Cod sursa(job #216509)
#include<stdio.h>
#include<math.h>
const int N=2000005;
bool c[N];
void ciur(int n)
{
int i,j;
for(i=2;i*i<=n;i++)
if(c[i]==false)
for(j=i*i;j<=n;j=j+i)
c[j]=true;
}
int numara(int n)
{
int i,nr=0;
for(i=2;i<=n;i++)
if(!c[i])
++nr;
return nr;
}
int main()
{
int nr,n;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur(n);
nr=numara(n);
printf("%d",nr);
return 0;
}