Zenith_Habitant的博客

int path[100005], cnt; void dfs(int now, int n, int m) //从n个数里面选出m个，存入path { if (now == m+1) { ++cnt; for(int i = 1; i <= m; ++i) cout << path[i] &...

#include&lt;stdio.h&gt; #include&lt;iostream&gt; using namespace std; int ma[5][5]; int dx[4]={0,-1,0,1}; int dy[4]={-1,0,1,0}; int start=0,last=1; struct node{ int x,y,pre; }vis[100]; void print(in...

#include &lt;iostream&gt; #include &lt;algorithm&gt; #include &lt;stdio.h&gt; #include &lt;string.h&gt; #include &lt;cstdlib&gt; const int maxn = 10 + 2; int map[maxn][maxn]; int flag; void Init() { ...