"""simple docstring"""
def 				lowerCAmelCase__      (     _UpperCamelCase    :			list[list[int]]	,     _UpperCamelCase    :			int	,     _UpperCamelCase    :			int	,     _UpperCamelCase    :			list[int]   )   ->			bool:





						"""simple docstring"""






						if graph[path[curr_ind - 1]][next_ver] == 0:
												return False

						# 2. Validate that next vertex is not already in path
						return not any(vertex == next_ver for vertex in path   )





def 				lowerCAmelCase__      (     _UpperCamelCase    :			list[list[int]]	,     _UpperCamelCase    :			list[int]	,     _UpperCamelCase    :			int   )   ->			bool:





						"""simple docstring"""






						if curr_ind == len(_UpperCamelCase   ):
												# return whether path exists between current and starting vertices
												return graph[path[curr_ind - 1]][path[0]] == 1

						# Recursive Step
						for next_ver in range(0	,     len(_UpperCamelCase   )   ):
												if valid_connection(_UpperCamelCase	,     _UpperCamelCase	,     _UpperCamelCase	,     _UpperCamelCase   ):
																		# Insert current vertex  into path as next transition
																		snake_case        =     next_ver
																		# Validate created path
																		if util_hamilton_cycle(_UpperCamelCase	,     _UpperCamelCase	,     curr_ind + 1   ):
																								return True
																		# Backtrack
																		snake_case        =     -1
						return False





def 				lowerCAmelCase__      (     _UpperCamelCase    :			list[list[int]]	,     _UpperCamelCase    :			int = 0   )   ->			list[int]:





						"""simple docstring"""






						snake_case        =     [-1] * (len(_UpperCamelCase   ) + 1)
						# initialize start and end of path with starting index
						snake_case        =     snake_case        =     start_index
						# evaluate and if we find answer return path either return empty array
						return path if util_hamilton_cycle(_UpperCamelCase	,     _UpperCamelCase	,     1   ) else []



"""simple docstring"""
import requests
from bsa import BeautifulSoup





def 				lowerCAmelCase__      (     _UpperCamelCase    :			str = "https://www.worldometers.info/coronavirus"   )   ->			dict:





						"""simple docstring"""






						snake_case        =     BeautifulSoup(requests.get(_UpperCamelCase   ).text	,     'html.parser'   )
						snake_case        =     soup.findAll('h1'   )
						snake_case        =     soup.findAll('div'	,     {'class': 'maincounter-number'}   )
						keys += soup.findAll('span'	,     {'class': 'panel-title'}   )
						values += soup.findAll('div'	,     {'class': 'number-table-main'}   )
						return {key.text.strip(): value.text.strip() for key, value in zip(_UpperCamelCase	,     _UpperCamelCase   )}


if __name__ == "__main__":
					print("\033[1m" + "COVID-19 Status of the World" + "\033[0m\n")
					for key, value in world_covidaa_stats().items():
										print(f"""{key}\n{value}\n""")


