D - oVeRfLoWs

CodeChefOpen on judge ↗

Calculate sum of all integers strictly less than $N$ that are divisble by both $a$ and $b$. Since this number could be very large, compute it modulo $10^{9}+7$. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, three integers $N,a,b$. ###Output: For each testcase, output in a single line answ

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