← Back

🔲 Magic Squares Dungeon

Reduce n to 0 using perfect squares (1, 4, 9, 16...) • Find minimum moves!

🎮 Reduce to Zero!

📐 DP Formula

dp[n] = 1 + min(dp[n - k²])
for all k² ≤ n
Your Moves
0
Optimal
-
Minimum Squares Needed
?

📜 Your Moves

💡 Hint

Greedy doesn't always work! Example: 12 = 9+1+1+1 (4 moves) but 12 = 4+4+4 (3 moves) is optimal.