Desik And Divisors

CodeChefOpen on judge ↗

Given two integers L and K. You are to find the minimum integer R such that Sum of the number of divisors of all numbers from L to R is greater than K. Input - First Line specifies an integer T, the number of test cases. - Every Test case consists of two integers L and K as described in problem statement. Output - For every test case print, the value of R in a new line and print - 1 if R - L

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