2 1
5 For each valid operation sequence, the visited coordinates are as follows (5 possibilities): * $(0, 0) \to (0, 1) \to (1, 1) \to (2, 1)$ * $(0, 0) \to (1, 0) \to (1, 1) \to (2, 1)$ * $(0, 0) \to (1, 0) \to (2, 0) \to (2, 1)$ * $(0, 0) \to (1, 0) \to (2, 1)$ * $(0, 0) \to (1, 1) \to (2, 1)$
12345 67890
824829859
{
"problem": {
"name": "Jump",
"description": {
"content": "On a 2D coordinate plane, a piece is placed at $(0, 0)$. You may perform the following operation any number of times (including zero): * Choose an integer pair $(a, b)$ such that $0 \\leq a \\leq 1",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "fps_24_h"
},
"statements": [
{
"statement_type": "Markdown",
"content": "On a 2D coordinate plane, a piece is placed at $(0, 0)$. \nYou may perform the following operation any number of times (including zero):\n\n* Choose an integer pair $(a, b)$ such that $0 \\leq a \\leq 1...",
"is_translate": false,
"language": "English"
}
]
}