Pagini recente » Borderou de evaluare (job #2919493) | Diferente pentru tree-decompositions intre reviziile 3 si 4 | Cod sursa (job #2701082) | Cod sursa (job #2596540) | Cod sursa (job #744512)
Cod sursa(job #744512)
#include <stdio.h>
using namespace std;
int v[2000002],cont=1;
int main ()
{
freopen ( "ciur.in", "r", stdin);
freopen ( "ciur.out", "w", stdout);
int n;
scanf( "%d", &n);
int i;
for ( i=2 ; i<=n ; i*=2)
v[i]=1;
i=3;
while( i <= n)
{
cont++;
for( int j=1; j*i<=n; j++)
v[j*i]=1;
while(v[i]==1)
i+=2;
}
printf( "%d", cont);
}