{"trustable":false,"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":"Problem Statement","value":{"format":"MD","content":"Given a string containing uppercase English letters, return the number of subsequences that are equal to `QAQ`."}},{"title":"Input","value":{"format":"MD","content":"The input consists of a one-line string, having length $N$."}},{"title":"Output","value":{"format":"MD","content":"Print the answer to the problem statement, the number of subsequences that are equal to `QAQ` in the given string."}},{"title":"Constraints","value":{"format":"MD","content":"* $1 \\le N \\le 100$"}},{"title":"Sample 1","value":{"format":"MD","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\u003eQQABQ\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Explanation 1","value":{"format":"MD","content":"The two subsequences equal to `QAQ` in the provided string are: \"\u003cspan class\u003d\"tex-font-style-tt\"\u003e**Q**Q**A**B**Q**\u003c/span\u003e\" and \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eQ**QA**B**Q**\u003c/span\u003e\"."}},{"title":"Sample 2","value":{"format":"MD","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\u003eABCDEFGQAQAAAAAAAA\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Explanation 2","value":{"format":"MD","content":"The only subsequence that equals to `QAQ` is \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eABCDEFG**QAQ**AAAAAAAA\u003c/span\u003e\"."}},{"title":"Sample 3","value":{"format":"MD","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\u003eEFQBCJRDDQBYATFVQCEWQAUATIUOPLARTRACEGHCARTQUQPQBCQBGRTBECVDQFFGVWWTF\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e114\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"Follow Up 1","value":{"format":"MD","content":"Can you write an algorithm that runs in $O(N)$ time?"}},{"title":"Follow Up 2","value":{"format":"MD","content":"Given the constraints ($1 \\le N \\le 100$), Jimmy claims that the output must be a number between 0 and 37026 (incl.). Do you agree with him? Why?"}},{"title":"Follow Up 3","value":{"format":"MD","content":"Jimmy wants to create an example test case such that the output is $514$. Is this possible? Why?\n(Hint: running the prime factorization algorithm on $514$ gives $2$ and $257$.)"}}]}