diff --git a/backtracking/power_sum.py b/backtracking/power_sum.py
index fcf1429f8570..23e2b13c6c70 100644
--- a/backtracking/power_sum.py
+++ b/backtracking/power_sum.py
@@ -6,8 +6,6 @@
 The only solution is 2^2+3^2. Constraints: 1<=X<=1000, 2<=N<=10.
 """
 
-from math import pow
-
 
 def backtrack(
     needed_sum: int,
@@ -23,8 +21,8 @@ def backtrack(
     (0, 3)
     >>> backtrack(100, 3, 1, 0, 0)
     (0, 1)
-    >>> backtrack(800, 2, 1, 0, 0)
-    (0, 561)
+    >>> backtrack(500, 2, 1, 0, 0)
+    (0, 109)
     >>> backtrack(1000, 10, 1, 0, 0)
     (0, 0)
     >>> backtrack(400, 2, 1, 0, 0)
@@ -32,6 +30,8 @@ def backtrack(
     >>> backtrack(50, 1, 1, 0, 0)
     (0, 3658)
     """
+    from math import pow
+
     if current_sum == needed_sum:
         # If the sum of the powers is equal to needed_sum, then we have a solution.
         solutions_count += 1
@@ -61,8 +61,8 @@ def solve(needed_sum: int, power: int) -> int:
     3
     >>> solve(100, 3)
     1
-    >>> solve(800, 2)
-    561
+    >>> solve(500, 2)
+    109
     >>> solve(1000, 10)
     0
     >>> solve(400, 2)