Maximum Special Sum

CodeChefRating 3043Open on judge ↗

Given an array of size $N$ and two integers $K$ and $S$, the special sum of a subarray is defined as follows: (Sum of all elements of the subarray) * ($K$ - $p$ * $S$) Where $p$ = number of distinct prime factors of “product of all elements of the subarray”. Find the maximum special sum by considering all non-empty subarrays of the given array. ###Input - First line conta

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