



"""simple docstring"""






import random






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


       '''simple docstring'''





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

       # if probability is greater or equal than 1, then generate a complete graph
       if probability >= 1:
              return complete_graph(A_						)
       # 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(A_						):
              for j in range(i + 1,    A_						):
                     if random.random() < probability:
                            graph[i].append(A_						)
                            if not directed:
                                   # if the graph is undirected, add an edge in from j to i, either
                                   graph[j].append(A_						)
       return graph






def 	snake_case_  (				A_ :		int						):


       '''simple docstring'''





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


if __name__ == "__main__":
   import doctest

   doctest.testmod()







"""simple docstring"""






from itertools import permutations






def 	snake_case_  (				A_ :		tuple						):


       '''simple docstring'''





       if num[3] % 2 != 0:
              return False

       if (num[2] + num[3] + num[4]) % 3 != 0:
              return False

       if num[5] % 5 != 0:
              return False

       _lowerCamelCase						:    Any         =			[7, 11, 13, 17]
       for i, test in enumerate(A_						):
              if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                     return False
       return True






def 	snake_case_  (				A_ :		int = 10						):


       '''simple docstring'''





       return sum(
           int(''''''.join(map(A_,    A_						)						)						)
           for num in permutations(range(A_						)						)
           if is_substring_divisible(A_						)						)


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


