this question can be easily solved using RECURSION.

http://www.codechef.com/CODW2012/problems/BPHC03

but can anyone please help me in finding the minimum number of steps to reach the (n,n) from (1,1) ?

i am struggling for it… please help me…thanks in advance!!!