Divisible Pairs

CodeChefRating 1835Open on judge ↗

Given N and M Dexter wants to know how many pairs a,b(1 are there such that (a+b) is divisible by M. For example when N=4 and M=3, there are 2 possible pairs the sum of which is divisible by M and they are (1,2) and (2,4). Input First line of input contains T( which is the number of test cases. Each of the next T lines contains two integers N(1 and M(2 . Output Output one line per testcase, th

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