{"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":"\u003cdiv class\u003d\"panel_content\"\u003e\n有一个m*n的矩阵,每个格子内都有树,矩阵从(1,1)开始,到(m,n),然而增神站在(0,0)点,他能看见几棵树呢?如果增神和两个树连成一条线,则他仅能看见离他近的那个哦。\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"第一行包含一个整数t,表示测试用例的数量。然后有多个测试用例。对于每个测试用例,有一行包含两个整数m和n(1≤m, n≤100000)"}},{"title":"Output","value":{"format":"HTML","content":"对于每个测试用例输出一行,表示增神可以看到的树的数量"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e2\n1 1\n2 3\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e1\n5\n\u003c/pre\u003e"}}]}