这题有一个很简单的解法,只要C % gcd(A, B)则必有解,因为假设只从a倒到b,t = gcd(a, b),则b内的水必然可以达到这几个值:0, t, 2 * t, 3 * t, …, b,反过来同理,然后直接暴力模拟,如果a为空就装满然后往b里倒min(a, B – b)的水,因为b满了就不能再倒了,然后每次a -= min(a, B – b),然后如果b满了就把b清空。
#include<bits/stdc++.h>
using namespace std;
int cal(int A, int B, int C)
{
int a = A, b = 0, cnt = 1;
while (1){
int t = min(a, B - b);
a -= t; b += t;
++cnt;
if (a == C || b == C) break;
if (a == 0) a = A, ++cnt;
else if (b == B) b = 0, ++cnt;
}
return cnt;
}
int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}
int main()
{
int t;
cin >> t;
while (t--){
int A, B, C;
cin >> A >> B >> C;
if ((C > A && C > B) || C % gcd(A, B)) cout << "-1" << endl;
else if (A == C || B == C) cout << "1" << endl;
else cout << min(cal(A, B, C), cal(B, A, C)) << endl;
}
return 0;
}