Weekend Programming Challenge – Week #25 Equal Travel Paths



If we have matrix with size M x N and two points A(xa,ya) and B(xb,yb), C obstracles which are entered with their coordinates and and length of path L
Make code which:

  •  inputs the matrix size M and N
  •  inputs the point A(x,y) coordinates
  •  inputs the point B(x,y) coordinates
  •  inputs the number of Obstracles C
  •  inputs the obstracles C(x,y) coordinates
  •  inputs the path length

Then displays all variants (if any) one can move from point A to point B by traveling via L cells. You can step on one cell just once and only if the cell have no obstracle.

The valid moves are only up-down-left-right.

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday September 23th.

On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC

You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.

1 Comment (+add yours?)

  1. Spas
    Sep 22, 2013 @ 14:41:05

    Wow, these are progressively evolving harder and harder. I am passing this one 🙂


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: