Hang Over for a party

CodeChefOpen on judge ↗

Problem description. Bharath and Ravi are feeling bored during Management class. Ravi challenged Bharath to play a game. If Bharath wins, then Ravi will take him to party, otherwise vice-versa. Bharath accepted the challenge. Ravi will give two arrays kbk,prk, for every element i, kbk[i],prk[i], Bharath needs to find the minimum number X which satisfies the following equation X%kbk[i] = prk[i]

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