API Response (JSON)
{
"problem": {
"name": "A. 2-3-numbers",
"description": {
"content": "A positive integer is called a _2-3-integer_, if it is equal to 2_x_·3_y_ for some non-negative integers _x_ and _y_. In other words, these integers are such integers that only have 2 and 3 among thei",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF953A"
},
"statements": [
{
"statement_type": "Markdown",
"content": "A positive integer is called a _2-3-integer_, if it is equal to 2_x_·3_y_ for some non-negative integers _x_ and _y_. In other words, these integers are such integers that only have 2 and 3 among thei...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "一个正整数被称为 _2-3整数_，如果它等于 $2^x \\cdot 3^y$，其中 $x$ 和 $y$ 是某些非负整数。换句话说，这些整数的素因子中仅包含 $2$ 和 $3$。例如，整数 $1$、$6$、$9$、$16$ 和 $108$ 是 2-3 整数，而 $5$、$10$、$21$ 和 $120$ 不是。\n\n请输出给定区间 $[l, r]$ 上 _2-3整数_ 的数量，即满足 $l \\leq ...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ S = \\{ 2^x \\cdot 3^y \\mid x, y \\in \\mathbb{Z}_{\\geq 0} \\} $ be the set of 2-3-integers.\n\n**Constraints** \nGiven integers $ l, r \\in \\mathbb{Z} $ such that $ 1 \\leq l \\leq r \\l...",
"is_translate": false,
"language": "Formal"
}
]
}