Question

You will be given a square matrix of N rows and columns containing positive and negative integers with absolute value not larger than thousand you are required to compute the greatest some achievable by walking a path starting at any cell of the matrix and always moving downward to the right words. Additionally you have to report the number of times that values achievable and will be in the first line of the input and lines follow with n integers each, you should output a single line with two integers separated by single blank space. First one is the greatest some second one is the number of times this value can be reached.


Please help me with coding​

Answer 1

Explanation:

yghbqg gwngm jgwngamwgnwynwgjwfb nefg