API Response (JSON)
{
"problem": {
"name": "Ternary Decomposition",
"description": {
"content": "You are given integers $N$ and $K$. Is it possible to express $N$ as the sum of exactly $K$ numbers of the form $3^m$ ($m$ is a non-negative integer)? In other words, is there a sequence of non-negati",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "arc164_a"
},
"statements": [
{
"statement_type": "Markdown",
"content": "You are given integers $N$ and $K$. Is it possible to express $N$ as the sum of exactly $K$ numbers of the form $3^m$ ($m$ is a non-negative integer)? In other words, is there a sequence of non-negati...",
"is_translate": false,
"language": "English"
}
]
}