DISTINCT ARRAY

CodeChefOpen on judge ↗

You are given an array A of N integers, and an integer K. You want to find out how many different arrays you can obtain by applying the following operation atmost once. In one operation you can select X (0 <= X <= K) distinct indices of the array and multiply their value by -1. Answer could be large, print it modulo 1e9 + 7. ### Input - The first line of input will contain a single integer $T$

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