zhangzhenjunaixuxin的博客

#include <cstdio>#include <cmath>using namespace std;typedef long long ll;//走的是日字，以为任意两点间走六步即可到达，所以只要超过六步就停止，深度优先搜索会产生很多分支，所以一定要设置边界否则一定超时int num[9][9];int comun[8][2]= {{1,-2},{-1,-...

#include<iostream>#include<cstdio>#include<vector>#include<cstdio>#include<cstdlib>#include<cmath>#include<cstring>#include<string>#include<...