{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section 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\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Bài toán","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eCó \u003cvar\u003e\\(N\\)\u003c/var\u003e đứa trẻ, được đánh số từ \u003cvar\u003e\\(1, 2, \\ldots, N\\)\u003c/var\u003e.\u003c/p\u003e\n\u003cp\u003eHọ đã quyết định chia \u003cvar\u003e\\(K\\)\u003c/var\u003e viên kẹo cho nhau.\nỞ đây, với mỗi \u003cvar\u003e\\(i\\)\u003c/var\u003e (\u003cvar\u003e\\(1 \\leq i \\leq N\\)\u003c/var\u003e), Đứa trẻ thứ \u003cvar\u003e\\(i\\)\u003c/var\u003e phải nhận từ \u003cvar\u003e\\(0\\)\u003c/var\u003e đến \u003cvar\u003e\\(a_i\\)\u003c/var\u003e viên kẹo (bao gồm cả 2 giới hạn).\nNgoài ra, không được để lại kẹo nào.\u003c/p\u003e\n\u003cp\u003eTìm số cách chia kẹo cho chúng, theo modulo \u003cvar\u003e\\(10^9 + 7\\)\u003c/var\u003e.\nỞ đây, hai cách được coi là khác nhau khi có ít nhất một đứa trẻ nhận số kẹo khác nhau.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Điều kiện","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cul\u003e\n\u003cli\u003eTất cả các giá trị trong input đều là số nguyên.\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq N \\leq 100\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(0 \\leq K \\leq 10^5\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(0 \\leq a_i \\leq K\\)\u003c/var\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/section\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eInput được cung cấp từ Standard Input theo định dạng sau:\u003c/p\u003e\n\u003cpre\u003e\u003cvar\u003e\\(N\\)\u003c/var\u003e \u003cvar\u003e\\(K\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(a_1\\)\u003c/var\u003e \u003cvar\u003e\\(a_2\\)\u003c/var\u003e \u003cvar\u003e\\(\\ldots\\)\u003c/var\u003e \u003cvar\u003e\\(a_N\\)\u003c/var\u003e\r\n\u003c/pre\u003e\n\u003c/section\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eIn ra số cách chia kẹo cho các đứa trẻ, theo modulo \u003cvar\u003e\\(10^9 + 7\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 1","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\u003e3 4\r\n1 2 3\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e5\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003cp\u003eCó năm cách chia kẹo cho các đứa trẻ, như sau:\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cvar\u003e\\((0, 1, 3)\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\((0, 2, 2)\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\((1, 0, 3)\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\((1, 1, 2)\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\((1, 2, 1)\\)\u003c/var\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003eỞ đây, trong mỗi chuỗi, phần tử thứ \u003cvar\u003e\\(i\\)\u003c/var\u003e đại diện cho số kẹo mà Đứa trẻ thứ \u003cvar\u003e\\(i\\)\u003c/var\u003e nhận được.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 2","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\u003e1 10\r\n9\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003cp\u003eCó thể không có cách nào để chia kẹo cho các đứa trẻ.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 3","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\u003e2 0\r\n0 0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003cp\u003eCó một cách để chia kẹo cho các đứa trẻ, như sau:\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cvar\u003e\\((0, 0)\\)\u003c/var\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 4","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\u003e4 100000\r\n100000 100000 100000 100000\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e665683269\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003cp\u003eHãy chắc chắn in ra kết quả theo modulo \u003cvar\u003e\\(10^9 + 7\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}}]}