Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Sign In with Facebook Sign In with Google Sign In with OpenID

Categories

We have migrated to a new platform! Please note that you will need to reset your password to log in (your credentials are still in-tact though). Please contact lee@programmersheaven.com if you have questions.
Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

The Cipher Challenge

AlfredoG4AlfredoG4 Posts: 1Member
Hello everyone, my algorithms teacher told us to look for an algorithm solving this problem and explaining it, help is very appreciated as we are not that deep into algorithms yet.


Given a list of 4, 5, 6 ... or 10 integers (between 1 and 100) find the way of getting another integer between 1 and 2000, using only the basic operations: add, substract, multiply and divide. each number in the list can only be used once.

challenge: design, implement and document a solution to the problem, faster than the example program (which I will link later", for sizes between 6 and 10, and that it cannot lose a solution, the program must indicaite all the reachable numbers between 1 and 2000, using the input data.



here is the link, if you need help understanding it just let me know, drop me a message or something

http://dis.um.es/~ginesgm/files/cifras.exe

thanks in advance!
Sign In or Register to comment.