APTZ_MANCHOW SOUP_CHALLENGE

CodeChefOpen on judge ↗

You are given a cube of side n * n * n painted on k (0<=k<=3) pairs of opposite sides which is uniformly cut into smaller cubes of dimension 1*1*1, you need to find the number of cubes with 0 side painted, with 1 sides painted, with 2 sides painted and with 3 sides painted. ### Input First Line contain a single digit t which represents the number of testcases next t lines contains 2 space separa

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI