API Response (JSON)
{
"problem": {
"name": "B. Beautiful Divisors",
"description": {
"content": "Recently Luba learned about a special kind of numbers that she calls _beautiful_ numbers. The number is called _beautiful_ iff its binary representation consists of _k_ + 1 consecutive ones, and then ",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF893B"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Recently Luba learned about a special kind of numbers that she calls _beautiful_ numbers. The number is called _beautiful_ iff its binary representation consists of _k_ + 1 consecutive ones, and then ...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "最近，Luba 学习了一种她称为 _beautiful_ 数的特殊数字。一个数字被称为 _beautiful_，当且仅当它的二进制表示由 #cf_span[k + 1] 个连续的 1，后跟 #cf_span[k] 个连续的 0 组成。\n\n一些 beautiful 数的例子：\n\n更形式化地说，一个数字是 beautiful 的，当且仅当存在某个正整数 #cf_span[k]，使得该数字等于 #cf_...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ k \\in \\mathbb{Z}^+ $. A number $ b_k $ is *beautiful* if: \n$$\nb_k = (2^k - 1) \\cdot 2^{k-1}\n$$\n\n**Given** \nAn integer $ n \\in \\mathbb{Z} $ such that $ 1 \\leq n \\leq 10^5 $.\n\n...",
"is_translate": false,
"language": "Formal"
}
]
}