




"""simple docstring"""




def      __UpperCAmelCase     ( __UpperCamelCase	,				__UpperCamelCase	):
			print('''\nThe shortest path matrix using Floyd Warshall algorithm\n'''	)
			for i in range(__UpperCamelCase	):
						for j in range(__UpperCamelCase	):
									if dist[i][j] != float('''inf'''	):
												print(int(dist[i][j]	)	,				end='''\t'''	)
									else:
												print('''INF'''	,				end='''\t'''	)
						print()







def      __UpperCAmelCase     ( __UpperCamelCase	,				__UpperCamelCase	):
			__lowercase			:  List[Any]								=       [[float('''inf'''	) for _ in range(__UpperCamelCase	)] for _ in range(__UpperCamelCase	)]

			for i in range(__UpperCamelCase	):
						for j in range(__UpperCamelCase	):
									__lowercase			:  Tuple								=       graph[i][j]

									# check vertex k against all other vertices (i, j)
			for k in range(__UpperCamelCase	):
						# looping through rows of graph array
						for i in range(__UpperCamelCase	):
									# looping through columns of graph array
									for j in range(__UpperCamelCase	):
												if (
												    dist[i][k] != float('''inf'''	)
												    and dist[k][j] != float('''inf'''	)
												    and dist[i][k] + dist[k][j] < dist[i][j]
												):
															__lowercase			:  List[Any]								=       dist[i][k] + dist[k][j]

			_print_dist(__UpperCamelCase	,				__UpperCamelCase	)
			return dist, v


if __name__ == "__main__":
			a_        =       int(input('Enter number of vertices: '))
			a_        =       int(input('Enter number of edges: '))

			a_        =       [[float('inf') for i in range(v)] for j in range(v)]

			for i in range(v):
						a_        =       0.0

						# src and dst are indices that must be within the array size graph[e][v]
						# failure to follow this will result in an error
			for i in range(e):
						print('\nEdge ', i + 1)
						a_        =       int(input('Enter source:'))
						a_        =       int(input('Enter destination:'))
						a_        =       float(input('Enter weight:'))
						a_        =       weight

			floyd_warshall(graph, v)

			# Example Input
			# Enter number of vertices: 3
			# Enter number of edges: 2

			# # generated graph from vertex and edge inputs
			# [[inf, inf, inf], [inf, inf, inf], [inf, inf, inf]]
			# [[0.0, inf, inf], [inf, 0.0, inf], [inf, inf, 0.0]]

			# specify source, destination and weight for edge #1
			# Edge  1
			# Enter source:1
			# Enter destination:2
			# Enter weight:2

			# specify source, destination and weight for edge #2
			# Edge  2
			# Enter source:2
			# Enter destination:1
			# Enter weight:1

			# # Expected Output from the vertice, edge and src, dst, weight inputs!!
			# 0		INF	INF
			# INF	0	2
			# INF	1	0







def 		_A		(		_lowercase = 1_00 )					-> int:


     """simple docstring"""


     __UpperCamelCase =			0
     __UpperCamelCase =			0
     for i in range(1					,  n + 1 ):
          sum_of_squares += i**2
          sum_of_ints += i
     return sum_of_ints**2 - sum_of_squares


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


