rain_ton的博客

https://vjudge.net/problem/15199/origin 超经典深搜题，需要注意的是搜索的顺序 上代码：#include<iostream> #include<cstdio> #include<cstring> #include<string> int n1,n2; int vis[30][30],flag,num,xx[30],yy[30]; int dir[8][2]=

https://vjudge.net/problem/30554/origin 中文题意，不解释#include<iostream> #include<algorithm> #include<cstring> using namespace std; int a[11],vis[11],ans; void dfs(int time,int sum){ if(sum>ans)return;