Can anyone help me solve a krypto problem with iterators?

Question

anyone can help me I am desperately trying to write a method takes a target and an array of non-zero values, and returns true if there is a Krypto solution.
A krypto solution is one that you are given a set of non-zero int values and an int target.
Your goal is to form an arithmetic expression using those numbers (in any order) and the operators +, -, *, /, or %.
You must use each value exactly once, though you can use operators any number of times.
this is the start of the test method I have to work with:
public static void testSolveKrypto() {
// 1 + 2 * 3 + 4 = 13, among others
verify(solveKrypto(13,new int[]{1,2,3,4}));
// 1 + 3 * 4 - 2 = 14, among others
verify(solveKrypto(14,new int[]{1,2,3,4}));
// No solution for 29:
verify(!solveKrypto(29,new int[]{1,2,3,4}));
// harder problems with solutions
verify(solveKrypto(80,new int[]{2, 6, 7, 8}));
verify(solveKrypto(-59, new int[]{4, 6, 8, 9, 10}));
verify(solveKrypto(-1240,new int[]{5, 6, 7, 15, 16, 19}));
verify(solveKrypto(145927, new int[]{5, 21, 22, 77, 81, 89, 94}));
// harder problems without solutions
// interesting aside: in each case, the given target is the first positive
// target which is not solvable for the given set of numbers!
verify(!solveKrypto(33,new int[]{2, 6, 7, 8}));
verify(!solveKrypto(131, new int[]{4, 6, 8, 9, 10}));
verify(!solveKrypto(949,new int[]{5, 6, 7, 15, 16, 19}));
verify(!solveKrypto(10486, new int[]{5, 21, 22, 77, 81, 89, 94}));
if anyone can help or get me started that would greatly be appreciated

Answer 1

h1. {color:red}CROSS-POST{color}
[http://forum.java.sun.com/thread.jspa?messageID=10174551]