HDU5584 LA7411 LCM Walk【数学规律】

LCM Walk

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 3506 Accepted Submission(s): 1836

Problem Description
A frog has just learned some number theory, and can’t wait to show his ability to his girlfriend.

Now the frog is sitting on a grid map of infinite rows and columns. Rows are numbered 1,2,⋯ from the bottom, so are the columns. At first the frog is sitting at grid (sx,sy), and begins his journey.

To show his girlfriend his talents in math, he uses a special way of jump. If currently the frog is at the grid (x,y), first of all, he will find the minimum z that can be divided by both x and y, and jump exactly z steps to the up, or to the right. So the next possible grid will be (x+z,y), or (x,y+z).

After a finite number of steps (perhaps zero), he finally finishes at grid (ex,ey). However, he is too tired and he forgets the position of his starting grid!

It will be too stupid to check each grid one by one, so please tell the frog the number of possible starting grids that can reach (ex,ey)!

Input
First line contains an integer T, which indicates the number of test cases.

Every test case contains two integers ex and ey, which is the destination grid.

⋅ 1≤T≤1000.
⋅ 1≤ex,ey≤109.

Output
For every test case, you should output “Case #x: y”, where x indicates the case number and counts from 1 and y is the number of possible starting grids.

Sample Input
3
6 10
6 8
2 8

Sample Output
Case #1: 1
Case #2: 2
Case #3: 3

Source
2015ACM/ICPC亚洲区上海站-重现赛（感谢华东理工）

问题链接：HDU5584 LA7411 LCM Walk
问题简述：（略）
问题分析：数学规律题，看程序。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* HDU5584 LA7411 LCM Walk */

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int t, x, y;
    scanf("%d", &t);
    for(int k = 1; k <= t; k++) {
        scanf("%d%d", &x, &y);

        if(x < y) swap(x, y);
        int cnt = 1, g = __gcd(x, y);
        while(x % (y + g) == 0) {
            cnt++;
            x = x / (y / g + 1);
            if(x < y) swap(x, y);
        }

        printf("Case #%d: %d\n", k, cnt);
    }

    return 0;
}