c 这道题的答案是什么?
程序参考如下:#includeusingnamespacestd;?constintdj[]={1,2,2,1,-1,-2,-2,-1};constintdi[]={2,1,-1,-2,-2,-1,1,2};boolq[13][13];int?bi[101],bj[101];intm,n;voidprint(intt){??inti;??for(i=0;i>m>>n;??for(i=1;i>x;?q[i1][j1]=!x;}??bi[0]=1;??bj[0]=1;??work(1,1,1);}例样输入正确的是66011111111011101110111001110111111100输出:(1,1)-(3,2)-(5,3)-(6,5)-(4,4)-(3,6)-(2,4)-(4,5)-(6,6)(1,1)-(3,2)-(5,3)-(4,5)-(6,6)(1,1)-(3,2)-(4,4)-(6,5)-(5,3)-(4,5)-(6,6)(1,1)-(3,2)-(4,4)-(3,6)-(2,4)-(4,5)-(6,6)(1,1)-(3,2)-(2,4)-(4,5)-(6,6)(1,1)-(3,2)-(2,4)-(3,6)-(4,4)-(6,5)-(5,3)-(4,5)-(6,6)