Oh no my queen

CodeChefOpen on judge ↗

Given K. You have to find the minimum possible value of n such that on a n*n chessboard you can fill n-k queens and cover all the squares on the board. ### Input - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single integer $K$. ### Output For each test case, the minimum $N$ such that using $N-K$ queens entire chessboard will be c

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