摘要： #include #include #include #include #include using namespace std;int ans,end;vector graph[100001];int visited[100001] = {0};typedef struct{ int v,n;}Node; void dfs(int v){ vector::iterator it; visited[v] = 1; //printf("%5d", v); for (it = graph[v].begin(); it != graph[v].end(); ++it) ... 阅读全文

摘要： #include #include int dir[8][2]={{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}};int flag[100][100],cnt,m,n;struct node{ char letter; int num;}arr[1000];void dfs(int a,int b,int cur){ /*赋值*/ arr[cur].letter='A'+a-1; arr[cur].num=b; flag[a][b]=1; /*判断结束条件*/ if(cur==m*n) { cnt=cur; re 阅读全文