题解:
倒推,考虑如何从a/b推到1/1。可以发现如果a > b 那么上一次一定是由a - b / b得到的,a < b同理,其实就是一个辗转相减法
先将a和b约分,然后辗转相减统计次数即可
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<climits>
#include<vector>
#define MAXA 100005
using namespace std;
typedef long long LL;
LL a,b,T,GCD,Ans,Xiangcha,Cishu;
LL gcd(LL a,LL b) {
if(b == 0)
return a;
else return gcd(b,a % b);
}
int main() {
// freopen("capacitor.in","r",stdin);
// freopen("capacitor.out","w",stdout);
scanf("%lld",&T);
while(T--) {
Ans = 0;
scanf("%lld %lld",&a,&b);
GCD = gcd(a,b);
a /= GCD;
b /= GCD;
if(a == 1 && b == 1) {
printf("1\n");
continue;
}
while(a != 1 || b != 1) {
if(a > b) {
Xiangcha = a - b;
Cishu = Xiangcha / b + 1;
a -= Cishu * b;
if(!a) a = 1;
Ans += Cishu;
continue;
}
if(a < b){
Xiangcha = b - a;
Cishu = Xiangcha / a + 1;
b -= Cishu * a;
if(!b) b = 1;
Ans += Cishu;
continue;
}
}
printf("%lld\n",Ans);
}
}