{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n sj学姐热爱下棋,这一天她新研究出一种下棋方法,此棋子只向前方相邻的棋格行进,不能后退。现给你一个起点,一个终点,sj想知道棋子有多少种可走的路线。\n \u003cbr\u003e棋盘的布局如下所示。 \n \u003cbr\u003e \n\u003cimg style\u003d\"max-width:100%;\" SRC\u003d\"CDN_BASE_URL/db4917bb4b1bd4e9ccc285a9597f8e31?v\u003d1572271903\"\u003e \n \u003cbr\u003e \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"第一行是一个整数N,表示测试实例的个数,然后是N 行数据,每行包含两个整数a和b(0\u0026lt;a\u0026lt;b\u0026lt;50)。 a代表起点,b代表终点\n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"对于每个测试实例,请输出从棋格a到棋格b的路线总数,每个实例的输出占一行。 \n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e3\n1 2\n3 6\n5 7\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e1\n3\n2\n\u003c/pre\u003e"}}]}