Optimized cell increasing in brainfuck

https://esolangs.org/wiki/Brainfuck_constants gives the shortest known ways to get different values (marked as to how many cells they use and whether they rely on wraparound on overflow). To equal all the ones that use only two cells, your program will need to be a bit more complicated but it looks doable.

well, I did it myself, however it is not a very nice code, since it checks all the possibilities for a number and return the smallest. I also included an offset option, so that the calcucating cell is not required to be the cell right to it (right to it == offset of 1).

def num ( number, off = 1 ) :
  code = "[-]"
  if not number : return code
  char = "-" if number > 127 else "+"
  number = ( 256 - number ) if number > 127 else number
  table = { }
  for i in range ( number ) :
    loop = ( off * 4 + 3 + i + number // i ) if i else 0
    if i :
      if ( number % i ) <= ( ( - number ) % i ) :
        mod = number % i
      else :
        mod = (( - number ) % i )
        loop += 1
    else :
      mod = number
    table [ i ] = loop + mod
  mins = [ ]
  for i in table :
    if table [ i ] == min ( table.values ( )) : mins.append ( i )
  m = min ( mins )
  if m :
    if ( number % m ) <= ( ( - number ) % m ) :
      mchar = char
      mod = number % m
      app = number // m
    else :
      mchar = "+" if char == "-" else "-"
      mod = (( - number ) % m )
      app = number // m + 1
    code += ">" * off + m * "+" + "[" + "<" * off
    code += app * char + ">" * off + "-]" + "<" * off
    code += mod * mchar
  else :
    mod = number
    code += mod * char

  return code

Edit: fixed small mistake for negative modulo calculation