{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003eGiven a string consisting of numbers from \u00270\u0027 to \u00279\u0027, find the smallest \u003cb\u003enon-negative\u003c/b\u003e integer that does not occur as a \u003cb\u003econtiguous subsequence\u003c/b\u003e in the given string.\u003c/p\u003e\r\n\r\n\u003ch3\u003eInput\u003c/h3\u003e\r\n\u003cp\u003eInput only contains a string S (|S| \u0026lt;\u003d 100000), which consists of numbers from \u00270\u0027 to \u00279\u0027.\u0026nbsp;\u003c/p\u003e\r\n\r\n\u003ch3\u003eOutput\u003c/h3\u003e\r\n\u003cp\u003eOutput the smallest \u003cb\u003enon-negative\u003c/b\u003e integer that does not occur as a \u003cb\u003econtiguous subsequence\u003c/b\u003e in the given string.\u003c/p\u003e\r\n\r\n\u003ch3\u003eExample\u003c/h3\u003e\r\n\u003ch4\u003eInput 1\u003c/h4\u003e\r\n\u003cpre\u003e0123456789\u003c/pre\u003e\r\n\r\n\u003ch4\u003eOutput 1\u003c/h4\u003e\r\n\u003cpre\u003e10\u003c/pre\u003e\r\n\r\n\u003ch4\u003eInput 2\u003c/h4\u003e\r\n\u003cpre\u003e21698921085321984125\u003c/pre\u003e\r\n\r\n\u003ch4\u003eOutput 2\u003c/h4\u003e\r\n\u003cpre\u003e7\u003c/pre\u003e\r\n\r\n\u003ch4\u003eInput 3\u003c/h4\u003e\r\n\u003cpre\u003e01234567891011121314151617181920\u003c/pre\u003e\r\n\r\n\u003ch4\u003eOutput 3\u003c/h4\u003e\r\n\u003cpre\u003e22\u003c/pre\u003e\r\n\n\u003c/div\u003e"}}]}