E - Tom and modulo

CodeChefOpen on judge ↗

Tom is taking another test that requires knowledge of modular arithmetics. As you know Tom is weak in maths so he needs your help. The problem statement is as follows: You are given two numbers $X$ & $Y$ ($X$ != $Y$) your task is to determine **count** of such positive numbers $K$ that the remainders of X and Y when divided by K are the same. More formally you need to determine **co

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