qq_52011873的博客

HDU-1207 汉诺塔II 基础汉诺塔思路 acwing题解 b站视频 #include<iostream> #include<algorithm> #include<cstring> #define ull unsigned long long using namespace std; const int N = 100; ull d[N],f[N]; int main() { d[1] = 1; for(int i=2;i<=N;i++) d[

HDU-2553 N皇后问题 //打表 /*#include<iostream> #include<cstring> using namespace std; const int N = 40; int dx[N],dy[N],dz[N]; int n,ans; int cnt[N]; void dfs(int r) { if(r>n) { ans++; return; } else { for(int i=1;i<=n;i++) {