Language: C++

This is a recursion problem. With the given code figure out if a perfect match exist. You are trying to find the maximum value that equal to the given target. for example if the user's target is 77. find a combination that will equal 77.

Let us say the values are arranged in two dimensional array instead. The thief wants to start anywhere, pick up a series of items (by going up, down, left or right after picking up each item) and hopes for the total to match the target value. Here are a few examples using 4x4 array. Items in GREEN are selected & they total to specified target value in each case. 15 10 44 19 Target: 77 91 7 24 21 17 9 1 45 3 9 67 32 15 10 4 19 Target: 64 91 7 24 21 9 17 1 45 3 9 67 32 Target: 61 15 10 4 19 91 7 24 21 9 17 1 45 3 9 67 32 15 10 4 19 Target: 141 91 7 24 21 9 17 1 45 3 9 67 32 int n int values n x n array