21 August 2014 04:32:41 PM CHANGE_MAKING_PRB C++ version Test the CHANGE_MAKING library. TEST01: List the problem data. Test 0: Number of coins = 3 Values = 5 9 13 Target = 19 Test 1: Number of coins = 5 Values = 1 4 5 8 11 Target = 29 Test 2: Number of coins = 6 Values = 1 5 10 25 50 100 Target = 96 Test 3: Number of coins = 7 Values = 1 2 6 12 24 48 60 Target = 96 Test 4: Number of coins = 3 Values = 1 3 4 Target = 6 Test 5: Number of coins = 6 Values = 16 17 23 24 39 40 Target = 100 Test 6: Number of coins = 3 Values = 6 9 20 Target = 43 TEST02: CHANGE_MAKING LIST computes A(T), the smallest number of coins needed to form a given sum T, by computing the list A(0) through A(T). Test 0: Number of coins = 3 Values = 5 9 13 Target = 19 0 0 1 Not possible 2 Not possible 3 Not possible 4 Not possible 5 1 6 Not possible 7 Not possible 8 Not possible 9 1 10 2 11 Not possible 12 Not possible 13 1 14 2 15 3 16 Not possible 17 Not possible 18 2 19 3 Test 1: Number of coins = 5 Values = 1 4 5 8 11 Target = 29 0 0 1 1 2 2 3 3 4 1 5 1 6 2 7 3 8 1 9 2 10 2 11 1 12 2 13 2 14 3 15 2 16 2 17 3 18 3 19 2 20 3 21 3 22 2 23 3 24 3 25 4 26 3 27 3 28 4 29 4 Test 2: Number of coins = 6 Values = 1 5 10 25 50 100 Target = 96 0 0 1 1 2 2 3 3 4 4 5 1 6 2 7 3 8 4 9 5 10 1 11 2 12 3 13 4 14 5 15 2 16 3 17 4 18 5 19 6 20 2 21 3 22 4 23 5 24 6 25 1 26 2 27 3 28 4 29 5 30 2 31 3 32 4 33 5 34 6 35 2 36 3 37 4 38 5 39 6 40 3 41 4 42 5 43 6 44 7 45 3 46 4 47 5 48 6 49 7 50 1 51 2 52 3 53 4 54 5 55 2 56 3 57 4 58 5 59 6 60 2 61 3 62 4 63 5 64 6 65 3 66 4 67 5 68 6 69 7 70 3 71 4 72 5 73 6 74 7 75 2 76 3 77 4 78 5 79 6 80 3 81 4 82 5 83 6 84 7 85 3 86 4 87 5 88 6 89 7 90 4 91 5 92 6 93 7 94 8 95 4 96 5 Test 3: Number of coins = 7 Values = 1 2 6 12 24 48 60 Target = 96 0 0 1 1 2 1 3 2 4 2 5 3 6 1 7 2 8 2 9 3 10 3 11 4 12 1 13 2 14 2 15 3 16 3 17 4 18 2 19 3 20 3 21 4 22 4 23 5 24 1 25 2 26 2 27 3 28 3 29 4 30 2 31 3 32 3 33 4 34 4 35 5 36 2 37 3 38 3 39 4 40 4 41 5 42 3 43 4 44 4 45 5 46 5 47 6 48 1 49 2 50 2 51 3 52 3 53 4 54 2 55 3 56 3 57 4 58 4 59 5 60 1 61 2 62 2 63 3 64 3 65 4 66 2 67 3 68 3 69 4 70 4 71 5 72 2 73 3 74 3 75 4 76 4 77 5 78 3 79 4 80 4 81 5 82 5 83 6 84 2 85 3 86 3 87 4 88 4 89 5 90 3 91 4 92 4 93 5 94 5 95 6 96 2 Test 4: Number of coins = 3 Values = 1 3 4 Target = 6 0 0 1 1 2 2 3 1 4 1 5 2 6 2 Test 5: Number of coins = 6 Values = 16 17 23 24 39 40 Target = 100 0 0 1 Not possible 2 Not possible 3 Not possible 4 Not possible 5 Not possible 6 Not possible 7 Not possible 8 Not possible 9 Not possible 10 Not possible 11 Not possible 12 Not possible 13 Not possible 14 Not possible 15 Not possible 16 1 17 1 18 Not possible 19 Not possible 20 Not possible 21 Not possible 22 Not possible 23 1 24 1 25 Not possible 26 Not possible 27 Not possible 28 Not possible 29 Not possible 30 Not possible 31 Not possible 32 2 33 2 34 2 35 Not possible 36 Not possible 37 Not possible 38 Not possible 39 1 40 1 41 2 42 Not possible 43 Not possible 44 Not possible 45 Not possible 46 2 47 2 48 2 49 3 50 3 51 3 52 Not possible 53 Not possible 54 Not possible 55 2 56 2 57 2 58 3 59 Not possible 60 Not possible 61 Not possible 62 2 63 2 64 2 65 3 66 4 67 4 68 4 69 3 70 3 71 3 72 3 73 3 74 3 75 4 76 Not possible 77 Not possible 78 2 79 2 80 2 81 3 82 4 83 5 84 5 85 3 86 3 87 3 88 3 89 4 90 4 91 4 92 4 93 4 94 3 95 3 96 3 97 3 98 4 99 5 100 6 Test 6: Number of coins = 3 Values = 6 9 20 Target = 43 0 0 1 Not possible 2 Not possible 3 Not possible 4 Not possible 5 Not possible 6 1 7 Not possible 8 Not possible 9 1 10 Not possible 11 Not possible 12 2 13 Not possible 14 Not possible 15 2 16 Not possible 17 Not possible 18 2 19 Not possible 20 1 21 3 22 Not possible 23 Not possible 24 3 25 Not possible 26 2 27 3 28 Not possible 29 2 30 4 31 Not possible 32 3 33 4 34 Not possible 35 3 36 4 37 Not possible 38 3 39 5 40 2 41 4 42 5 43 Not possible CHANGE_MAKING_PRB Normal end of execution. 21 August 2014 04:32:41 PM