Weekend Programming Challenge – Week #32 Solutions


This was not easy challenge 🙂 optimization for two dimensions require either full permutations either heuristic approach which will be fast but not optimal in many cases.

We got only 4 submissions, our heroes are:

1. Marc – Pascal

2. Nigel Mollett – C#

3. Piotr Gapinski – Prolog

4. Todor Nikodimov – C++

How Piotr manages to solve such hard problems with Prolog is mystery to me, but this just prove that once you know how to solve problem you can code it in any language 🙂

You can enjoy the solutions at GitHub as usual https://github.com/OLIMEX/WPC/tree/master/ISSUE-32

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: