Chef and Array and K
Chef has an array A consisting of N integers. He also has an intger K. Chef wants you to find out number of different arrays he can obtain from array A by applying the following operation exactly K times. - Pick some element in the array and multiply it by -1 As answer could be quite large, print it modulo 109 + 7. Input - The first line of the input contains an integer T denoting th
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