API Response (JSON)
{
"problem": {
"name": "B. Nikita and string",
"description": {
"content": "One day Nikita found the string containing letters \"_a_\" and \"_b_\" only. Nikita thinks that string is beautiful if it can be cut into 3 strings (possibly empty) without changing the order of the lett",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF877B"
},
"statements": [
{
"statement_type": "Markdown",
"content": "One day Nikita found the string containing letters \"_a_\" and \"_b_\" only.\n\nNikita thinks that string is beautiful if it can be cut into 3 strings (possibly empty) without changing the order of the lett...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "有一天，Nikita 找到了一个仅包含字母 \"_a_\" 和 \"_b_\" 的字符串。\n\nNikita 认为，如果一个字符串可以被切割成 #cf_span[3] 个子串（允许为空），且不改变字母的顺序，其中第 #cf_span[1] 个和第 #cf_span[3] 个子串仅包含字母 \"_a_\"，而第 #cf_span[2] 个子串仅包含字母 \"_b_\"，那么这个字符串就是美丽的。\n\nNikita 希望...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ s \\in \\{a, b\\}^* $ be the input string of length $ n \\leq 5000 $. \n\nA *beautiful string* is a subsequence of $ s $ that can be partitioned into three contiguous (in order) sub...",
"is_translate": false,
"language": "Formal"
}
]
}