2 1 3 3 1
6 The following six paths satisfy the requirements. ($(i, j)$ denotes the square at the $i$\-th row from the top and $j$\-th column from the left. Each path is represented as a sequence of squares it visits.) * $(1,1)$ * $(1,1)$ → $(1,2)$ → $(2,2)$ * $(1,1)$ → $(2,1)$ → $(2,2)$ * $(1,2)$ * $(2,1)$ * $(2,2)$
{
"problem": {
"name": "Ex - Yet Another Path Counting",
"description": {
"content": "We have a grid of squares with $N$ rows arranged vertically and $N$ columns arranged horizontally. The square at the $i$\\-th row from the top and $j$\\-th column from the left has an integer label $a_{",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc259_h"
},
"statements": [
{
"statement_type": "Markdown",
"content": "We have a grid of squares with $N$ rows arranged vertically and $N$ columns arranged horizontally. The square at the $i$\\-th row from the top and $j$\\-th column from the left has an integer label $a_{...",
"is_translate": false,
"language": "English"
}
]
}