Pagini recente » Borderou de evaluare (job #2509174) | Borderou de evaluare (job #1210806) | Cod sursa (job #3239042) | Cod sursa (job #1477553) | Cod sursa (job #313699)
Cod sursa(job #313699)
#include<stdio.h>
#include<math.h>
using namespace std;
long n,v[2000100],tot;
int main()
{
long i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld",&n);
for(i=2;i<=n;i++)
{
if(!v[i])
{
if(i<=sqrt(n))
{
for(j=i+1;j<=n;j++)
{
if(j%i==0)v[j]=1;
}
}
}
}
for(i=2;i<=n;i++)
{
if(!v[i])tot++;
}
printf("%lld",tot);
return 0;
}