????? visit[1][1]=1;
??????? printf("Scenario #%d:\n",k);
??????? if(dfs(1,1,2))
??????? {
??????????? for(i=1; i<=p*q; i++)
??????????????? printf("%c%d",way[i][1]-1+'A',way[i][0]);
??????????? printf("\n");
??????? }
??????? else
??????????? printf("impossible\n");
??????? if(k!=t)
??????????? printf("\n");
??? }
??? return 0;
}
?
|