






"""simple docstring"""





def 							A(    snake_case_		,  snake_case_						):
       """simple docstring"""





       print("\nVertex Distance"						)
       for i in range(snake_case_						):
              if dist[i] != float("inf"						):
                     print(snake_case_		,  "\t"		,  int(dist[i]						)		,  end="\t"						)
              else:
                     print(snake_case_		,  "\t"		,  "INF"		,  end="\t"						)
              print()






def 							A(    snake_case_		,  snake_case_		,  snake_case_						):
       """simple docstring"""





       lowercase__:							List[str]         =     float("inf"						)
       lowercase__:							Any         =     -1
       for i in range(snake_case_						):
              if (not vset[i]) and mdist[i] < min_val:
                     lowercase__:							List[Any]         =     i
                     lowercase__:							int         =     mdist[i]
       return min_ind






def 							A(    snake_case_		,  snake_case_		,  snake_case_						):
       """simple docstring"""





       lowercase__:							Dict         =     [float("inf"						) for _ in range(snake_case_						)]
       lowercase__:							Tuple         =     [False for _ in range(snake_case_						)]
       lowercase__:							Union[str, Any]         =     0.0

       for _ in range(v - 1						):
              lowercase__:							Tuple         =     min_dist(snake_case_		,  snake_case_		,  snake_case_						)
              lowercase__:							int         =     True

              for i in range(snake_case_						):
                     if (
                         (not vset[i])
                         and graph[u][i] != float("inf"						)
                         and mdist[u] + graph[u][i] < mdist[i]
                     ):
                            lowercase__:							Optional[int]         =     mdist[u] + graph[u][i]

       print_dist(snake_case_		,  snake_case_						)


if __name__ == "__main__":
  UpperCamelCase					=     int(input("""Enter number of vertices: """).strip())
  UpperCamelCase					=     int(input("""Enter number of edges: """).strip())

  UpperCamelCase					=     [[float("""inf""") for i in range(V)] for j in range(V)]

  for i in range(V):
    UpperCamelCase					=     0.0

  for i in range(E):
    print("""\nEdge """, i + 1)
    UpperCamelCase					=     int(input("""Enter source:""").strip())
    UpperCamelCase					=     int(input("""Enter destination:""").strip())
    UpperCamelCase					=     float(input("""Enter weight:""").strip())
    UpperCamelCase					=     weight

  UpperCamelCase					=     int(input("""\nEnter shortest path source:""").strip())
  dijkstra(graph, V, gsrc)










from itertools import combinations_with_replacement






def 	lowerCamelCase_       (			_a = 100			):




		"""simple docstring"""






		lowerCAmelCase__  :     list[int]       	=   [*list(range(1      ,  21			)			), 25]
		lowerCAmelCase__  :     list[int]       	=   [2 * x for x in range(1      ,  21			)] + [50]
		lowerCAmelCase__  :     list[int]       	=   [3 * x for x in range(1      ,  21			)]
		lowerCAmelCase__  :     list[int]       	=   singles + doubles + triples + [0]

		lowerCAmelCase__  :     int       	=   0
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int

		for double in doubles:
				for throwa, throwa in combinations_with_replacement(_a      ,  2			):
						lowerCAmelCase__  :     Dict       	=   double + throwa + throwa
						if checkout_total < limit:
								num_checkouts += 1

		return num_checkouts


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




