Minimum Size

CodeChefOpen on judge ↗

Find the minimum size ‘K’ of subarrays needed from two arrays A and B (one from array A and one from array B of K size, their positions doesn’t matter), so that the product of sum of that two subarrays is greater than equal to P. If no answer exists, print -1. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of 4 lines of input. -

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