"""simple docstring"""


def 			__UpperCAmelCase    (	lowercase						):







  """simple docstring"""

  if isinstance(lowercase      ,lowercase						):
    raise TypeError("""'float' object cannot be interpreted as an integer"""						)
  if isinstance(lowercase      ,lowercase						):
    raise TypeError("""'str' object cannot be interpreted as an integer"""						)

  if num == 0:
    return "0b0"

  _UpperCAmelCase         =					False

  if num < 0:
    _UpperCAmelCase         =					True
    _UpperCAmelCase         =					-num

  _UpperCAmelCase         =					[]
  while num > 0:
    binary.insert(0      ,num % 2						)
    num >>= 1

  if negative:
    return "-0b" + "".join(str(lowercase						) for e in binary						)

  return "0b" + "".join(str(lowercase						) for e in binary						)


if __name__ == "__main__":
    import doctest

    doctest.testmod()

"""simple docstring"""


UpperCAmelCase__     						=  [
    [0, 1_6, 1_3, 0, 0, 0],
    [0, 0, 1_0, 1_2, 0, 0],
    [0, 4, 0, 0, 1_4, 0],
    [0, 0, 9, 0, 0, 2_0],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]






def 			__UpperCAmelCase    (	lowercase      ,lowercase      ,lowercase      ,lowercase						):







  """simple docstring"""
  # Return True if there is node that has not iterated.
  _UpperCAmelCase         =					[False] * len(lowercase						)
  _UpperCAmelCase         =					[s]
  _UpperCAmelCase         =					True

  while queue:
    _UpperCAmelCase         =					queue.pop(0						)
    for ind in range(len(graph[u]						)						):
      if visited[ind] is False and graph[u][ind] > 0:
        queue.append(lowercase						)
        _UpperCAmelCase         =					True
        _UpperCAmelCase         =					u

  return visited[t]






def 			__UpperCAmelCase    (	lowercase      ,lowercase      ,lowercase						):







  """simple docstring"""
  _UpperCAmelCase         =					[-1] * (len(lowercase						))
  _UpperCAmelCase         =					0
  _UpperCAmelCase         =					[]
  _UpperCAmelCase         =					[i[:] for i in graph]  # Record original cut, copy.
  while bfs(lowercase      ,lowercase      ,lowercase      ,lowercase						):
    _UpperCAmelCase         =					float("""Inf"""						)
    _UpperCAmelCase         =					sink

    while s != source:
      # Find the minimum value in select path
      _UpperCAmelCase         =					min(lowercase      ,graph[parent[s]][s]						)
      _UpperCAmelCase         =					parent[s]

    max_flow += path_flow
    _UpperCAmelCase         =					sink

    while v != source:
      _UpperCAmelCase         =					parent[v]
      graph[u][v] -= path_flow
      graph[v][u] += path_flow
      _UpperCAmelCase         =					parent[v]

  for i in range(len(lowercase						)						):
    for j in range(len(graph[0]						)						):
      if graph[i][j] == 0 and temp[i][j] > 0:
        res.append((i, j)						)

  return res


if __name__ == "__main__":
    print(mincut(test_graph, source=0, sink=5))
