It may appear more familiar to you if you consider the possible permutations as binary patterns. In Norm's example, if - = 1 and + = 0, then the equivalent 0/1 binary patterns are:
10
11
01
...
Type: Posts; User: GregBrannon
Re: can someone solve this problem
It may appear more familiar to you if you consider the possible permutations as binary patterns. In Norm's example, if - = 1 and + = 0, then the equivalent 0/1 binary patterns are:
10
11
01
...
Re: can someone solve this problem
What's preventing you from coding it yourself? No one here will do it for you, but we'll do our best to help you with your code. Post some, and ask specific questions about it if you're having...