n-Bishop problem!

CodeChefOpen on judge ↗

Dheeraj loves chess a lot as much I do, thus whenever he gets time he asks me to have a tournament with him.But this time I tried to trick his mind by imposing conditions on the play.He being confused needs your help to win this game. Suppose you are given a chess board and you have only bishops in the chess board (1000000 by 1000000) We know bishops move digonally ,now you have to tell how many

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