摘要： http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1050位运算+BFS^运算表示 翻转#include<iostream>#include<string>#include<queue>#include<cstring>using namespace std;int vis[(1<<16)+1],dir[5][2]={1,0,-1,0,0,1,0,-1,0,0};int ANS;struct node{ int step,key;};node fir;string m 阅读全文