Shirley_xyx的博客

在这里插入#include <stdio.h> const int N = 100; int x, s[N]; bool dfs(int cur, int num, int pre) {//当前深度、最大深度、上次结束后的值 if (cur == num && pre == x) return true; if (cur >= n...

关于迭代加深和启发式函数的详细解说：https://blog.youkuaiyun.com/flsjzl/article/details/51785488 #include<iostream> #include<cstdio> #include<cstring> using namespace std; const int m