int getnum( char s[] )
{
return (s[0]-'0')*1000 + (s[1]-'0')*100+(s[2]-'0')*10+(s[3]-'0');
}
①cin>>testcase;
-----------------
#include<queue>
struct point
{
int x,y;
point operator + (point a)
{
point t;
t.x=x+a.x;
t.y=y+a.y;
return t;
}
}p[5],v,que[1000000];
void BFS(passwd initer,passwd traget)
{
memset(visited,0,sizeof(visited));
queue<passwd> q;
passwd start=initer;
passwd end;
start.step=0;
q.push(start);
…
while(!q.empty())
{
start=q.front();
q.pop();
…
}
}