{"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":"给你一个只包含数字[0,9]的字符串。\u003cbr\u003e\n你可以在字符之间加上\u0027 + \u0027或\u0027 - \u0027,使得字符串成为一个带加减法的式子。\u003cbr\u003e\n例如对于“12345”,你可以将他变成\"123+4-5”。\u003cbr\u003e\n现在给你一个整数N,计算有多少种方法可以使式子的结果等于N。\u003cbr\u003e\n你只能在两个相邻字符中选择最多一个符号。\u003cbr\u003e"}},{"title":"Input","value":{"format":"HTML","content":"多组数据,每组数据给出数字串S和一个整数n,( |S|\u003c\u003d12,|n|\u003c1e12)\n"}},{"title":"Output","value":{"format":"HTML","content":"输出有多少种方法,可以使式子的结果等于N"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e123456789 3\n21 1\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e18\n1\u003c/pre\u003e"}}]}