


'''simple docstring'''






def     UpperCamelCase_      (   A__ :       List[str] ):
		'''simple docstring'''





		lowerCAmelCase_      :				Optional[int]      =       [0] * len(a__ )
		lowerCAmelCase_      :				Optional[Any]      =       []
		lowerCAmelCase_      :				List[Any]      =       [1] * len(a__ )

		for values in graph.values():
				for i in values:
						indegree[i] += 1

		for i in range(len(a__ ) ):
				if indegree[i] == 0:
						queue.append(a__ )

		while queue:
				lowerCAmelCase_      :				str      =       queue.pop(0 )
				for x in graph[vertex]:
						indegree[x] -= 1

						if long_dist[vertex] + 1 > long_dist[x]:
								lowerCAmelCase_      :				Optional[Any]      =       long_dist[vertex] + 1

						if indegree[x] == 0:
								queue.append(a__ )

		print(max(a__ ) )


# Adjacency list of Graph
__A :  Any    							=				{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}
longest_distance(graph)







'''simple docstring'''






from __future__ import annotations







def     UpperCamelCase_      (   A__ :       int | float | str							,   A__ :       int | float | str ):
  '''simple docstring'''





  if nth_term == "":
    return [""]
  lowerCAmelCase_      :				str      =       int(A__ )
  lowerCAmelCase_      :				Tuple      =       int(A__ )
  lowerCAmelCase_      :				list[str]      =       []
  for temp in range(int(A__ ) ):
    series.append(f'1 / {pow(temp + 1							,   int(A__ ) )}' if series else """1""" )
  return series


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  __A :  str    							=				int(input("Enter the last number (nth term) of the P-Series"))
  __A :  Tuple    							=				int(input("Enter the power for  P-Series"))
  print("Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p")
  print(p_series(nth_term, power))



