Product Sum Arrays (Hard)
**This is the hard version of the problem. Here, you need to find the exact value of $R$.** You are given an integer $N$. An array $A$ is called *good* if it satisfies all of the following conditions: - $1 \le A_i \le N$ for all $1 \le i \le |A|$ - $A_i \le A_{i + 1}$ for all $1 \le i < |A|$ - $A_1 + A_2 + \ldots + A_{|A|} = N$ - $A_1 \times A_2 \times \ldots \times A_{|A|} = N$ In other word
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.
Sign in to chat with the tutor and save your progress.
Sign in to start