QUESTION 3

CodeChefOpen on judge ↗

###Abrez and Strings ###Constraints - 1 ≤ $T$ ≤ 200 - 1 ≤ $n$,$m$ ≤ 10 ###Sample Input: 2 1 1 2 3 ###Sample Output: 1 6 ###Explanation: For second sample, the number of strings that can be made are 6 that is: BBBAA,BBABA,BBAAB,BABBA,BAABB,BABAB.

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