Max Out

CodeChefRating 1621Open on judge ↗

You are given an array A of size N. Output the maximum value of A[i]%A[j] (ie. A[i] mod A[j]) over all 1 ≤ i, j ≤ N. Input First line of input contains T, the number of testcases. The first line of each test case contains N, the number of elements in the array. Second line of each testcase contains N space separated integers in which the ith integer is A[i]. Output For each testcase output a

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