BestCoder Round #74 (div.2) T2 DFS HDOJ 5636
includeincludeincludeincludeincludeusing namespace std;
int T,n,m,jia[10][10],vis[10],si,ti,MIN,mod=1e9+7;
long long ANS;
void dfs(int qi,int mo,int step)//起始位置,末位置,已有的步数;
{
if(qi==mo)
原创
2016-03-09 13:38:04 ·
257 阅读 ·
0 评论