code: def _divmod_pos(a, b):
      """Divide a non-negative integer a by a positive integer b, giving
      quotient and remainder."""
      # Use grade-school algorithm in base 2**n, n = nbits(b)
      n = b.bit_length()
      a_digits = _int2digits(a, n)
  
      r = 0
      q_digits = []
      for a_digit in reversed(a_digits):
          q_digit, r = _div2n1n((r << n) + a_digit, b, n)
          q_digits.append(q_digit)
      q_digits.reverse()
      q = _digits2int(q_digits, n)
      return q, r
  
file_path: cpython/Lib/_pylong.py
imports: import re
  import decimal
label_desc: Use image node_id 10 for calling a global function with example usage: _divmod_pos(a, b) and returns: q,  r