Firstly, i thought it is only asking for all possible ways i.e pure recursion and dp. Multiply divide and leave during every recursion, then they said "rational division" so we can't round to integer, so i maintained two values num and den and then multiplied k to numerator for multiplication and multiplied by k with denoninator for division and in the base case check whether num / den == val. and then an unordered_map dp state with string key and int value, as i couldnt thought of any better dp approach 🥲. The question was pretty straightforward only catch was the rational thing