By uncommenting the last part the code calculates the 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 ] ; }