Help with this counting lattice paths program using C++ with comments.

More Information about counting lattice paths

Set Up: Starting in the top left corner of a 2 x 2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner Directions: Compute the number of these types of routes through an n n grid for 1 Allow the user to choose the integer n. (Hint: be careful of memory overflow issues.) Input: integer n the size of the grid (ie n = 10 where the grid is n n 10 10) Output: the number of routes from the top left corner to the bottom right corner Extra Credit: allow the user to choose n20 n 20