Professor Goes Shopping

CodeChefOpen on judge ↗

Professor bought some heist tools from a store and he has two types of coins to pay the shopkeeper. The coins are of denominations $X$ Rs and $Y$ Rs. Now he wonders what is the **largest amount** that he cannot pay with these coins? ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, two **distinct** integers

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