Factorisation

CodeChefRating 3660Open on judge ↗

The statement of this problem is as easy as never before. You are given an integer N, you need to find M positive integers A1, A2, A3, ..., AM, so that A1*A2*A3*...*AM would be equal to N. You should maximize the number M. Input The first line of the input contains the integer T, denoting the number of the test cases. Then T lines follow, each one is describing a single test case and contain

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