<doocs>1175.Prime Arrangements_1.py
def count(n):
    cnt = 0
    primes = [True] * (n + 1)
    for i in range(2, n + 1):
        if primes[i]:
            cnt += 1
            for j in range(i + i, n + 1, i):
                primes[j] = False
    return cnt
def sample_funcname ( var_0 ) :
    var_2 = 0
    var_5 = [ True ] * ( var_0 + 1 )
    for var_8 in range ( 2 , var_0 + 1 ) :
        if var_5 [ var_8 ] :
            var_2 += 1
            for var_9 in range ( var_8 + var_8 , var_0 + 1 , var_8 ) :
                var_5 [ var_9 ] = False
    return var_2
