MAXWOODS  MAXIMUM WOOD CUTTER
Problem Statement:
The image explains it all. You initially step at 0,0 facing right. At each step you can move according to the conditions specified in the image. You cannot step into the blocked boxes (in blue). Find the maximum number of trees you can cut.
Input:
The first line consists of an integer t, the number of test cases. For each test case the first line consists of two integers m and n, the number of rows and columns. Then follows the description of the matrix M.
M[i][j]=’T’ if the region has a tree.
M[i][j]=’#’ if the region is blocked.
M[i][j]=’0’ (zero) otherwise.
Output:
For each test case find the maximum trees that you can cut.
Input Constraints:
1<=t<=10
1<=m,n<=200
Example:
Sample Input:
4 5 5 0TTTT T#T#0 #TT#T T00T0 T0#T0 1 1 T 3 3 T#T TTT T#T 1 1 #
Sample Output:
8 1 3 0
Solution for test case #1:
hide comments
dkkv0000:
20200125 10:50:08
ac in 1go 

sandeepd:
20191207 19:16:35
IMHO, I believe if you're handling the starting index having '#' separately, you aren't writing code the way it should be. Last edit: 20191207 19:17:14 

scolar_fuad:
20190904 05:37:24
NICE [spoiler] problem with [spoiler] state


sajalagrawal14:
20190625 21:28:13
nice question 

cenation007:
20190622 19:59:06
[spoiler] avoid TLE


navin_chandra:
20190522 20:24:59
Good question of [spoiler] for the beginner easy topdown code :)


gd251098:
20180209 12:57:30
[spoiler] did the job ;) 

mastik5h_1998:
20170922 03:08:38
easy topdown 

kartiks22:
20170805 09:51:25
ac in 1 go :)


anurag44:
20170616 23:13:31
easy [spoiler] !! Last edit: 20170802 13:11:04 
Added by:  cegprakash 
Date:  20121014 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU 
Resource:  Inspired from http://codeforces.com/problemset/problem/115/B 