Min Chain (ext_gcd)

                                      Problem C
                                       Min Chain
     Pr oblem Des cr iption
     Raven likes games of numbers. Today he meets two numbers and thinks whether
he could get a result of 1 by doing at least one operation (addition or subtraction).
However, he is tired of calculation; he also wants to know the minimum steps of
operation that he could get 1.
     Input Details
    The first line of the input contains an integer T, which indicates the number of test
cases.
     In the following T rows, there are two positive integers a, b ( 0<=a, b<=10^9) in
each row.
     Output Details
     For each case, output the least number of steps.
     If you cannot get 1, just output -1.
     Sample I nput
     3
     32
     16 9
     68
     Sample Output
     1
     10
     -1

 

 

这是去年四省赛的一题，有人说用扩展gcd做，就看了看。写完错了N回，按数据改，最后对了，但程序对不对也不知道。

特殊情况就是两个数中有0和1的，因为那样就不能求最大公约数了。

 

#include <iostream> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <string> #include <cstdio> #include <climits> #include <queue> #include <map> #include <list> #include <vector> using namespace std; int ext_gcd(int a, int b, int &x, int &y) { int d; if (b == 0) { x = 1; y = 0; return a; } else { d = ext_gcd(b, a % b, y, x); y -= (a / b) * x; } return d; } bool isp(int a, int b) { for (int i=2; i*i <= a && i*i <= b; i++) { if (a % i == 0 && b % i == 0) return false; } return true; } int main() { int n; scanf("%d", &n); while (n--) { int a, b; scanf("%d%d", &a, &b); if (a < b) { int t = a; a = b; b = t; } if (a == 1) { if (b == 0) { printf("1/n"); continue; } else { printf("2/n"); continue; } } if (b == 0) { printf("-1/n"); continue; } if (b == 1) { if (a == 2) printf("1/n"); else printf("2/n"); continue; } if (!isp(a, b)) { printf("-1/n"); continue; } int c, d; ext_gcd(a, b, c, d); int res = abs(c) + abs(d) - 1; if (res > 0) { printf("%d/n", res); continue; } printf("-1/n"); } return 0; }