


from __future__ import annotations




def        snake_case_					(  snake_case					)  ->    Any:

							# preprocessing the first row
							for i in range(1      ,							len(matrix[0]					)					):
														matrix[0][i] += matrix[0][i - 1]

							# preprocessing the first column
							for i in range(1      ,							len(snake_case					)					):
														matrix[i][0] += matrix[i - 1][0]

							# updating the path cost for current position
							for i in range(1      ,							len(snake_case					)					):
														for j in range(1      ,							len(matrix[0]					)					):
																					matrix[i][j] += min(matrix[i - 1][j]      ,							matrix[i][j - 1]					)

							return matrix[-1][-1]


if __name__ == "__main__":
	import doctest

	doctest.testmod()






from __future__ import annotations




def        snake_case_					(  snake_case      ,							snake_case					)  ->    list[str]:
       if nth_term == "":
              return [""]
       lowercase__:       Tuple        =       int(snake_case					)
       lowercase__:       int        =       int(snake_case					)
       lowercase__:       list[str]        =       []
       for temp in range(int(snake_case					)					):
              series.append(f'1 / {pow(temp + 1      ,							int(snake_case					)					)}' if series else '1'					)
       return series


if __name__ == "__main__":
 import doctest

 doctest.testmod()

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


