// L_minghao
// P1432 倒水问题
#include <bits/stdc++.h>
using namespace std;
#define INF 10000000
int ca, cb, N, t, ans;
bool vis[1005][1005];
vector<int> v, vv;
void dfs(int a, int b, int cnt)
{
vis[a][b] = true;
if (cnt > ans) // 剪枝
return;
if (b == N) // 达到所需状态
{
if (cnt < ans) // 更新最佳答案
{
ans = cnt;
vv = v;
}
return;
}
// 操作1:给A灌满水
if (vis[ca][b] == false && a < ca) // 此状态可以扩展
{
v.push_back(1);
dfs(ca, b, cnt + 1); // 深搜扩展
v.pop_back();
vis[ca][b] = false; // 回溯
}
// 操作2:给B灌满水
if (vis[a][cb] == false && b < cb)
{
v.push_back(2);
dfs(a, cb, cnt + 1);
v.pop_back();
vis[a][cb] = false;
}
// 操作3:将A中水倒空
if (vis[0][b] == false && a > 0)
{
v.push_back(3);
dfs(0, b, cnt + 1);
v.pop_back();
vis[0][b] = false;
}
// 操作4: 将B中水倒空
if (vis[a][0] == false && b > 0)
{
v.push_back(4);
dfs(a, 0, cnt + 1);
v.pop_back();
vis[a][0] = false;
}
// 操作5:将B中水倒入A
if (b >= ca - a)
{
if (vis[ca][b - (ca - a)] == false)
{
v.push_back(5);
dfs(ca, b - (ca - a), cnt + 1);
v.pop_back();
vis[ca][b - (ca - a)] = false;
}
}
else
{
if (vis[a + b][0] == false)
{
v.push_back(5);
dfs(a + b, 0, cnt + 1);
v.pop_back();
vis[a + b][0] = false;
}
}
// 操作6:将A中的水倒入B
if (a >= cb - b)
{
if (vis[a - (cb - b)][cb] == false)
{
v.push_back(6);
dfs(a - (cb - b), cb, cnt + 1);
v.pop_back();
vis[a - (cb - b)][cb] = false;
}
}
else
{
if (vis[0][a + b] == false)
{
v.push_back(6);
dfs(0, a + b, cnt + 1);
v.pop_back();
vis[0][a + b] = false;
}
}
}
void solve()
{
v.erase(v.begin(), v.end());
vv.erase(v.begin(), v.end());
memset(vis, 0, sizeof(vis));
ans = INF;
dfs(0, 0, 0);
cout << ans << " ";
for (int i = 0; i < vv.size(); ++i)
cout << vv[i] << " ";
cout << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> t;
while (t--)
{
cin >> ca >> cb >> N;
solve();
}
return 0;
}
03-17
1008