题解 | #走方格的方案数#
走方格的方案数
http://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
const lines=readline().split(' ').map(item=>parseInt(item))
const n=lines[0],m=lines[1]
let path=0
function dfs(i,j){
if(i==n && j==m){
path ++
}else{
if(i+1<=n){dfs(i+1,j)}
if(j+1<=m){dfs(i,j+1)}
}
}
dfs(0,0)
print(path)
