API Response (JSON)
{
"problem": {
"name": "A. QAQ",
"description": {
"content": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth. Now Diamond has given Bort a string consisting of only uppercase English letters of length _n_. T",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF894A"
},
"statements": [
{
"statement_type": "Markdown",
"content": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length _n_. T...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "\"QAQ\" 是一个表示哭泣的词语。想象 \"Q\" 是流着泪的眼睛，\"A\" 是嘴巴。\n\n现在，Diamond 给了 Bort 一个仅由大写英文字母组成的、长度为 #cf_span[n] 的字符串。这个字符串中包含大量 \"QAQ\"（Diamond 真可爱！）。\n\nBort 想知道，在 Diamond 给出的字符串中有多少个子序列 \"_QAQ_\"。注意，字母 \"_QAQ_\" 不必连续，但字母的顺序必须完全...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "Let $ s $ be a string of length $ n $, where $ s[i] \\in \\{ \\text{A}, \\text{Q}, \\dots \\} $ for $ 0 \\leq i < n $.\n\nDefine a subsequence \"QAQ\" as a triplet of indices $ (i, j, k) $ such that:\n- $ 0 \\leq ...",
"is_translate": false,
"language": "Formal"
}
]
}