comefrom: <garvit244>203_1.py
code: def countPrimes( n):
      if n < 2:
          return 0
      
      A = [0] * (n + 1)
      count = 0
      
      for pointer1 in range(2, n):
          if A[pointer1] == 0:
              count += 1
              pointer2 = pointer1
              while (pointer2 + pointer1 < n):
                  pointer2 += pointer1
                  A[pointer2] = 1
                  
      return count
masked: def sample_funcname ( var_0 ) :
      if var_0 < 2 :
          return 0
      var_4 = [ 0 ] * ( var_0 + 1 )
      var_5 = 0
      for var_7 in range ( 2 , var_0 ) :
          if var_4 [ var_7 ] == 0 :
              var_5 += 1
              var_8 = var_7
              while ( var_8 + var_7 < var_0 ) :
                  var_8 += var_7
                  var_4 [ var_8 ] = 1
      return var_5
  