|
-
December 10th, 2015, 05:44 AM
#1
Interesting Problem
Given an array of n numbers,develop a deterministic algorith that will say if it is possible or not to insert between each two numbers one of the operators "+", "-", "*"(multiplication), "/"(division),such as the result of the expression would be equal to 0.
Example:
1)7 3 2 2 -> 7-3-2*2 => Success
2)7 3 5 11 -> no possible combination => FAIL
Do you know an algorith for this problem or have an idea how to solve it?
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|