dfs
兔兔不爱吃萝卜
加油!!!!
展开
-
K - Prime Ring Problem(dfs)
#include<cstdio>#include<iostream>#include<algorithm>#include<stdio.h>#include<math.h>#include<string.h>#include<map>#include<vector>#include<queue>using namespace std;int n;bool biao[21]={0.原创 2021-05-30 08:56:14 · 72 阅读 · 0 评论 -
I - N皇后问题(dfs)
#include<cstdio>#include<iostream>#include<algorithm>#include<stdio.h>#include<math.h>#include<string.h>#include<map>#include<vector>#include<queue>using namespace std;int num,sum,N[14],flag;.原创 2021-05-27 20:52:09 · 70 阅读 · 0 评论