Need help with a C program I only need help with Program 22

Need help with a C++ program. I only need help with Program 2-2 the very last one.

Here is the directions: http://docdro.id/RQW7zjP

I have parts of my code here:

http://pastebin.com/dpxjNNdm

I want to make sure this is correct. It seems completely wrong.

Solution

#include <iostream>
using namespace std;

// Returns count of possible paths to reach cell at row number m and column
// number n from the topmost leftmost cell (cell at 1, 1)
int numberOfPaths(int m, int n)
{
// Create a 2D table to store results of subproblems
int count[m][n];

// Count of paths to reach any cell in first column is 1
for (int i = 0; i < m; i++)
count[i][0] = 1;

// Count of paths to reach any cell in first column is 1
for (int j = 0; j < n; j++)
count[0][j] = 1;

// Calculate count of paths for other cells in bottom-up manner using
// the recursive solution
for (int i = 1; i < m; i++)
{
for (int j = 1; j < n; j++)

// By uncommenting the last part the code calculatest he total
// possible paths if the diagonal Movements are allowed
count[i][j] = count[i-1][j] + count[i][j-1]; //+ count[i-1][j-1];

}
return count[m-1][n-1];
}

// Driver program to test above functions
int main()
{
cout << numberOfPaths(3, 3);
return 0;
}