摘要：
POJ 1753BFS位运算#include #include #include #include using namespace std;int map[6][6];int change[16] = { 51200, 58368, 29184, 12544, 35968, 20032, 10016, 4880, 2248, 1252, 626, 305, 140, 78, 39, 19 };int BFS(int state) { queue > Q; Q.push(make_pair(state, 0)); int tmp; pair cur; ... 阅读全文