[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：SGU 223\r\n\r\n在 $n \\times n$ 的棋盘上放 $k$ 个国王，国王可攻击相邻的 $8$ 个格子，求使它们无法互相攻击的方案总数。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"只有一行，包含两个整数 $n$ 和 $k$。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"每组数据一行为方案总数，若不能够放置则输出 $0$。","subType":"markdown"},{"sectionTitle":"样例 1","type":"Sample","text":"","subType":"markdown","payload":["3 2","16"]},{"sectionTitle":"样例 2","type":"Sample","text":"","subType":"markdown","payload":["4 4","79"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于全部数据，$1\\le n\\le 10, 0\\le k\\le n^2$。","subType":"markdown"}]