Given two points (x0,y0) and (x1,y1) on the x-y plane. In a north-east
path from (x0,y0) to (x1,y1), one may walk only to the north (up) and to
the east (right). Write a program to count the number of northeast paths
from one point to another.
any ideas how to start this ???