{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eConsider a sequence of digits of length $$$2^k$$$ $$$[a_1, a_2, \\ldots, a_{2^k}]$$$. We perform the following operation with it: replace pairs $$$(a_{2i+1}, a_{2i+2})$$$ with $$$(a_{2i+1} + a_{2i+2})\\bmod 10$$$ for $$$0\\le i\u0026lt;2^{k-1}$$$. For every $$$i$$$ where $$$a_{2i+1} + a_{2i+2}\\ge 10$$$ we get a candy! As a result, we will get a sequence of length $$$2^{k-1}$$$.\u003c/p\u003e\u003cp\u003eLess formally, we partition sequence of length $$$2^k$$$ into $$$2^{k-1}$$$ pairs, each consisting of 2 numbers: the first pair consists of the first and second numbers, the second of the third and fourth $$$\\ldots$$$, the last pair consists of the ($$$2^k-1$$$)-th and ($$$2^k$$$)-th numbers. For every pair such that sum of numbers in it is at least $$$10$$$, we get a candy. After that, we replace every pair of numbers with a remainder of the division of their sum by $$$10$$$ (and don\u0027t change the order of the numbers).\u003c/p\u003e\u003cp\u003ePerform this operation with a resulting array until it becomes of length $$$1$$$. Let $$$f([a_1, a_2, \\ldots, a_{2^k}])$$$ denote the number of candies we get in this process. \u003c/p\u003e\u003cp\u003eFor example: if the starting sequence is $$$[8, 7, 3, 1, 7, 0, 9, 4]$$$ then:\u003c/p\u003e\u003cp\u003eAfter the first operation the sequence becomes $$$[(8 + 7)\\bmod 10, (3 + 1)\\bmod 10, (7 + 0)\\bmod 10, (9 + 4)\\bmod 10]$$$ $$$\u003d$$$ $$$[5, 4, 7, 3]$$$, and we get $$$2$$$ candies as $$$8 + 7 \\ge 10$$$ and $$$9 + 4 \\ge 10$$$.\u003c/p\u003e\u003cp\u003eAfter the second operation the sequence becomes $$$[(5 + 4)\\bmod 10, (7 + 3)\\bmod 10]$$$ $$$\u003d$$$ $$$[9, 0]$$$, and we get one more candy as $$$7 + 3 \\ge 10$$$. \u003c/p\u003e\u003cp\u003eAfter the final operation sequence becomes $$$[(9 + 0) \\bmod 10]$$$ $$$\u003d$$$ $$$[9]$$$. \u003c/p\u003e\u003cp\u003eTherefore, $$$f([8, 7, 3, 1, 7, 0, 9, 4]) \u003d 3$$$ as we got $$$3$$$ candies in total.\u003c/p\u003e\u003cp\u003eYou are given a sequence of digits of length $$$n$$$ $$$s_1, s_2, \\ldots s_n$$$. You have to answer $$$q$$$ queries of the form $$$(l_i, r_i)$$$, where for $$$i$$$-th query you have to output $$$f([s_{l_i}, s_{l_i+1}, \\ldots, s_{r_i}])$$$. It is guaranteed that $$$r_i-l_i+1$$$ is of form $$$2^k$$$ for some nonnegative integer $$$k$$$.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$n$$$ ($$$1 \\le n \\le 10^5$$$)\u0026nbsp;— the length of the sequence.\u003c/p\u003e\u003cp\u003eThe second line contains $$$n$$$ digits $$$s_1, s_2, \\ldots, s_n$$$ ($$$0 \\le s_i \\le 9$$$).\u003c/p\u003e\u003cp\u003eThe third line contains a single integer $$$q$$$ ($$$1 \\le q \\le 10^5$$$)\u0026nbsp;— the number of queries.\u003c/p\u003e\u003cp\u003eEach of the next $$$q$$$ lines contains two integers $$$l_i$$$, $$$r_i$$$ ($$$1 \\le l_i \\le r_i \\le n$$$)\u0026nbsp;— $$$i$$$-th query. It is guaranteed that $$$r_i-l_i+1$$$ is a nonnegative integer power of $$$2$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eOutput $$$q$$$ lines, in $$$i$$$-th line output single integer\u0026nbsp;— $$$f([s_{l_i}, s_{l_i + 1}, \\ldots, s_{r_i}])$$$, answer to the $$$i$$$-th query.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e8\n8 7 3 1 7 0 9 4\n3\n1 8\n2 5\n7 7\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\n1\n0\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e6\n0 1 2 3 3 5\n3\n1 2\n1 4\n3 6\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\n0\n1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eThe first example illustrates an example from the statement.\u003c/p\u003e\u003cp\u003e$$$f([7, 3, 1, 7]) \u003d 1$$$: sequence of operations is $$$[7, 3, 1, 7] \\to [(7 + 3)\\bmod 10, (1 + 7)\\bmod 10]$$$ $$$\u003d$$$ $$$[0, 8]$$$ and one candy as $$$7 + 3 \\ge 10$$$ $$$\\to$$$ $$$[(0 + 8) \\bmod 10]$$$ $$$\u003d$$$ $$$[8]$$$, so we get only $$$1$$$ candy.\u003c/p\u003e\u003cp\u003e$$$f([9]) \u003d 0$$$ as we don\u0027t perform operations with it.\u003c/p\u003e"}}]}