题目

#include<bits/stdc++.h>
using namespace std;
int a,b,f,t=1,h=0,fen;
struct node{
	int step;
	int na;
	int nb;
	int u;
	int fa;
}q[100005];
void print(int x){
	if(q[x].fa==-1)
	{
		cout<<q[h].step<<' ';
		return;
	}
	print(q[x].fa);
	cout<<q[x].u<<' ';
}
int v[105][105];
int main()
{
	cin>>fen;
	while(fen--)
	{
//	memset(q,0,sizeof(q));
	t=1;h=0;
	memset(v,0,sizeof(v));
	cin>>a>>b>>f;
	q[1].step=0;
	q[1].na=0;
	q[1].nb=0;
	q[1].fa=-1;
	while(h<t)
	{
		h++;
		//cout<<q[h].step<<' '<<q[h].na<<' '<<q[h].nb<<' '<<q[h].u<<' '<<q[h].fa<<'\n';
		if(q[h].nb==f)
		{
			print(h);
			cout<<'\n';
			break;
		}
		if(q[h].na!=a&&v[a][q[h].nb]==0){//1
			t++;
			q[t].step=q[h].step+1;
			q[t].na=a;
			q[t].nb=q[h].nb;
			q[t].u=1;
			q[t].fa=h;	
			v[q[t].na][q[t].nb]=1;
		}
		if(q[h].nb!=b&&v[q[h].na][b]==0){//2
		//if(v1[q[h].na]&&v2[b])continue;
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na;
			q[t].nb=b;
			q[t].u=2;
			q[t].fa=h;	
			v[q[t].na][q[t].nb]=1;
		}
		if(q[h].na&&v[0][q[h].nb]==0){//3
		//if(v2[q[h].nb])continue;
			t++;
			q[t].step=q[h].step+1;
			q[t].na=0;
			q[t].nb=q[h].nb;
			q[t].u=3;
			q[t].fa=h;	
			v[q[t].na][q[t].nb]=1;
		}
		if(q[h].nb&&v[q[h].na][0]==0){//4	
		//if(v1[q[h].na])continue;
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na;
			q[t].nb=0;
			q[t].u=4;
			q[t].fa=h;
			v[q[t].na][q[t].nb]=1;
		}
		if(q[h].na&&q[h].nb!=b){//5	
			int dao=min(q[h].na+q[h].nb,b)-q[h].nb;	
			if(v[q[h].na-dao][q[h].nb+dao]==1)continue;
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na-dao;
			q[t].nb=q[h].nb+dao;
			q[t].u=6;
			q[t].fa=h;
			v[q[t].na][q[t].nb]=1;
		}
		if(q[h].nb&&q[h].na!=a){//6
			int dao=min(q[h].na+q[h].nb,a)-q[h].na;	
			if(v[q[h].na+dao][q[h].nb-dao]==1)continue;
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na+dao;
			q[t].nb=q[h].nb-dao;
			q[t].u=5;
			q[t].fa=h;
			v[q[t].na][q[t].nb]=1;
		}
	}
	}
	//cout<<-1;
}