LCM Walk HDU - 5584（数论+思维）

LCM Walk HDU - 5584

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

题意：

给定在某个坐标$(x,y)$的移动规则：

从点$(x,y)只能移动到(x + lcm(x,y),y) 或(x,y + lcm(x,y))$

给定终点$(e_x,e_y)$问有多少起点能够到达这个终点(坐标大于0)

分析：

根据题意从点

$$(x,y)\rightarrow (x,y+lcm(x,y))$$

$$\because lcm(x,y) = \frac{xy}{gcd(x,y)}$$

设$gcd(x,y) = g,则x = m_1g,y = m_2g$

$$\therefore lcm(x,y) = \frac{m_1m_2g^2}{g} = m_1m_2g$$

$$(x,y)\rightarrow (x,y+lcm(x,y))$$

$$\downarrow$$

$$(m_1g,m_2g) \rightarrow (m_1g,m_2g+m_1m_2g)$$

$$\downarrow$$

$$(m_1g,m_2g)\rightarrow (m_1g,m_2g\cdot(1+m_1))$$

$$\because m_1,m_2互质,m_1,m_1+1互质$$

$\therefore$转移到新坐标后，横纵坐标的最大公因数仍然是g

因此我们发现对于给定的终点$(e_x,e_y)$，可以到达这个终点的路径上的所有点坐标的横纵坐标最大公因数恒为$g$，并且前后必定满足式子

$$(m_1g,m_2g)\rightarrow (m_1g,m_2g\cdot(1+m_1))$$

所以我们只需要根据终点逆推回去就行了，对于到达位置的坐标，上式中纵坐标始终是较大的值，所以每次，我们只需要交换顺序，使得后者始终较大即可

那么什么时候终止呢？

仍然是观察上面前后坐标的关系

如果存在前一个坐标，当前坐标必然满足

$$(m_1g,m_2g\cdot(1+m_1)) = (m_1g,m_2\cdot(g+m_1g))$$

所以较大坐标内含有因子$(g+m_1g)$,因此我们只需要取模判断一下即可

$知道了终点坐标，首先我们可以求出最大公因数g，然后也就求出了m_1,有了m_1也就可以求出了m_2$

又一个当时没做出来的数论题mlgb

code：

#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
    return b ? gcd(b,a%b) : a;
}
int main(){
    int T,cas = 0;
    scanf("%d",&T);
    int x,y;
    while(T--){
        scanf("%d%d",&x,&y);
        int ans = 1;//终点也算一个
        int m1,m2;
        int g = gcd(x,y);
        if(x > y) swap(x,y);
        while(y % (x + g) == 0){
            ans++;
            x = x;
            y = y / (g + x) * g;
            if(x > y) swap(x,y);
        }
        printf("Case #%d: %d\n",++cas,ans);
    }
    return 0;
}