API Response (JSON)
{
"problem": {
"name": "Ex - Popcount Sum",
"description": {
"content": "Find the sum of popcounts of all integers between $1$ and $N$, inclusive, such that the remainder when divided by $M$ equals $R$. Here, the popcount of a positive integer $X$ is the number of $1$s i",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 4000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc283_h"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Find the sum of popcounts of all integers between $1$ and $N$, inclusive, such that the remainder when divided by $M$ equals $R$. \nHere, the popcount of a positive integer $X$ is the number of $1$s i...",
"is_translate": false,
"language": "English"
}
]
}