34. Little Bishops

最新推荐文章于 2020-10-22 00:09:19 发布

该博客已停用

最新推荐文章于 2020-10-22 00:09:19 发布

阅读量383

点赞数

分类专栏： 2017程序设计实践

本文链接：https://blog.csdn.net/qq_38597315/article/details/73432451

版权

2017程序设计实践专栏收录该内容

37 篇文章 5 订阅

订阅专栏

A bishop is a piece used in the game of chess which is played on a board of square grids. A bishop can only move diagonally from its current position and two bishops attack each other if one is on the path of the other. In the following figure, the dark squares represent the reachable locations for bishop B₁ form its current position. The figure also shows that the bishops B₁ and B₂ are in attacking positions whereas B₁ and B₃ are not. B₂ and B₃ are also in non-attacking positions.

Now, given two numbers n and k, your job is to determine the number of ways one can put k bishops on an n × n chessboard so that no two of them are in attacking positions.

Input

The input file may contain multiple test cases. Each test case occupies a single line in the input file and contains two integers n (1 ≤ n ≤ 8) and k (0 ≤ k ≤ n²).

A test case containing two zeros for n and k terminates the input and you won't need to process this particular input.

Output

For each test case in the input print a line containing the total number of ways one can put the given number of bishops on a chessboard of the given size so that no two of them are in attacking positions. You may safely assume that this number will be less than 10¹⁵.

测试输入	期待的输出	时间限制	内存限制	额外进程
测试用例 1	以文本方式显示 8 6↵ 4 4↵ 0 0↵	以文本方式显示 5599888↵ 260↵	1秒	64M	0

//看了讨论区里大佬给的打表的思路很6
#include<stdio.h>

int main()
{
	int n, k;
	int Map[9][16] =
	{
		{ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
		{ 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
		{ 1, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
		{ 1, 9, 26, 26, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
		{ 1, 16, 92, 232, 260, 112, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
		{ 1, 25, 240, 1124, 2728, 3368, 1960, 440, 32, 0, 0, 0, 0, 0, 0, 0 },
		{ 1, 36, 520, 3896, 16428, 39680, 53744, 38368, 12944, 1600, 64, 0, 0, 0, 0, 0 },
		{ 1, 49, 994, 10894, 70792, 282248, 692320, 1022320, 867328, 389312, 81184, 5792, 128, 0, 0, 0 },
		{ 1, 64, 1736, 26192, 242856, 1444928, 5599888, 14082528, 22522960, 22057472, 12448832, 3672448, 489536, 20224, 256, 0 }
	};
	while (scanf("%d %d",&n,&k) && (n+k))
		printf("%d\n", Map[n][k]);
	return 0;
}