maximum divisors

CodeChefOpen on judge ↗

You are given integers N and M. Consider a sequence a of length N consisting of positive integers such that a1+a2+a3+....+aN=M. Find the maximum possible value of the greatest common divisor of a1,a2,a3,...aN. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, two integers $N, M$. ### Output For each testca

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