



from __future__ import annotations
def 		UpperCamelCase     (       snake_case__	:   int | float | str	,					snake_case__	:   int | float | str     )     ->					list[str]:





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


if __name__ == "__main__":
    import doctest

    doctest.testmod()

    __UpperCAmelCase	       =int(input('''Enter the last number (nth term) of the P-Series'''))
    __UpperCAmelCase	       =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))








from graphs.minimum_spanning_tree_kruskal import kruskal
def 		UpperCamelCase     (       )     ->					Tuple:
   UpperCamelCase   :  List[str]						     =     9
   UpperCamelCase   :  Optional[Any]						     =     [
       [0, 1, 4],
       [0, 7, 8],
       [1, 2, 8],
       [7, 8, 7],
       [7, 6, 1],
       [2, 8, 2],
       [8, 6, 6],
       [2, 3, 7],
       [2, 5, 4],
       [6, 5, 2],
       [3, 5, 14],
       [3, 4, 9],
       [5, 4, 10],
       [1, 7, 11],
   ]

   UpperCamelCase   :  int						     =     kruskal(snake_case__	,					snake_case__     )

   UpperCamelCase   :  List[str]						     =     [
       [7, 6, 1],
       [2, 8, 2],
       [6, 5, 2],
       [0, 1, 4],
       [2, 5, 4],
       [2, 3, 7],
       [0, 7, 8],
       [3, 4, 9],
   ]

   assert sorted(snake_case__     ) == sorted(snake_case__     )



