{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \n \u003cbr\u003e在一个n*m的方块中,在只能向上或者向右走的情况下,请问从左下角到右上角有多少种方案\n \u003cbr\u003e\n \u003ccenter\u003e\n \u003cimg SRC\u003d\"CDN_BASE_URL/63b8b2e2f5461f09312012231352375b?v\u003d1560016233\"\u003e\n \u003c/center\u003e \n "}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 输入数据有多组,每次读入int类型n,m,表示方块为n*m形状。以n\u003dm\u003d0结束\n(n,m在int范围内)\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 对输入的每组数据输出一行,代表方案数\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e5 4\n1 1\n0 0\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e126\n2\n\u003c/pre\u003e"}}]}