摘要： #include<iostream>#include<cstdio>#include<cstdlib>#define maxn 100char ch[maxn][maxn];using namespace std;int length,width;void dfs(int x,int y){ ch[ 阅读全文

摘要： #include<iostream>#include<stack>#define maxn 30using namespace std;stack<int>st;int n,k,a[maxn];bool dfs(int i,int sum){ if(i==k) return sum==k;//加到最 阅读全文