
'''simple docstring'''






import random







def 		A_       (	_lowerCAmelCase   :    int				,	_lowerCAmelCase   :    float				,	_lowerCAmelCase   :    bool = False							):



      """simple docstring"""




      _lowerCamelCase				:   dict								=   {i: [] for i in range(_lowerCAmelCase							)}

      # if probability is greater or equal than 1, then generate a complete graph
      if probability >= 1:
            return complete_graph(_lowerCAmelCase							)
      # if probability is lower or equal than 0, then return a graph without edges
      if probability <= 0:
            return graph

      # for each couple of nodes, add an edge from u to v
      # if the number randomly generated is greater than probability probability
      for i in range(_lowerCAmelCase							):
            for j in range(i + 1				,	_lowerCAmelCase							):
                  if random.random() < probability:
                        graph[i].append(_lowerCAmelCase							)
                        if not directed:
                              # if the graph is undirected, add an edge in from j to i, either
                              graph[j].append(_lowerCAmelCase							)
      return graph







def 		A_       (	_lowerCAmelCase   :    int							):



      """simple docstring"""




      return {
          i: [j for j in range(_lowerCAmelCase							) if i != j] for i in range(_lowerCAmelCase							)
      }


if __name__ == "__main__":
  import doctest

  doctest.testmod()

'''simple docstring'''






from math import sqrt







def 		A_       (	_lowerCAmelCase   :    int = 1000000							):



      """simple docstring"""




      _lowerCamelCase				:   int								=   0
      _lowerCamelCase				:   int								=   0
      _lowerCamelCase				:   int

      while num_cuboids <= limit:
            max_cuboid_size += 1
            for sum_shortest_sides in range(2				,	2 * max_cuboid_size + 1							):
                  if sqrt(sum_shortest_sides**2 + max_cuboid_size**2							).is_integer():
                        num_cuboids += (
                            min(_lowerCAmelCase				,	sum_shortest_sides // 2							)
                            - max(1				,	sum_shortest_sides - max_cuboid_size							)
                            + 1
                        )

      return max_cuboid_size


if __name__ == "__main__":
 print(f'''{solution() = }''')