API Response (JSON)
{
"problem": {
"name": "A. Eleven",
"description": {
"content": "Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactly _n_ characters. <center>![image]",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF918A"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactly _n_ characters.\n\n<center>![image]...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "Eleven 想为自己选择一个新名字。作为一群极客，她的朋友们提出了一种选名算法。Eleven 希望她的名字恰好包含 #cf_span[n] 个字符。\n\n她的朋友建议，她的名字只能由大写和小写字母 '_O_' 组成。更准确地说，他们建议：如果 #cf_span[i] 属于斐波那契数列，则名字的第 #cf_span[i] 个字母应为 '_O_'（大写），否则为 '_o_'（小写）。名字中的字母编号从...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "Let $ n \\in \\mathbb{N} $, $ 1 \\leq n \\leq 1000 $.\n\nDefine the Fibonacci sequence $ F = \\{ f_1, f_2, f_3, \\dots \\} $ where:\n- $ f_1 = 1 $\n- $ f_2 = 1 $\n- $ f_k = f_{k-1} + f_{k-2} $ for $ k \\geq 3 $\n\nF...",
"is_translate": false,
"language": "Formal"
}
]
}