＜C＞. Rolling phase division

Count two numbers a,b When the greatest common divisor of , You can use the rolling division method .

for example 24 18

24%18 be equal to 6, It means that it cannot be divisible

I'll put b=18 This value , Assign to a=24

Add the remainder 6 Assign to b, became

18%6 be equal to 0, therefore b=6 Is my greatest common divisor

Write according to this idea ：

#include<stdio.h>
int main()
{
	int a = 0;
	int b = 0;
	scanf("%d %d", &a, &b);
	int m = 0;
	while (m = a % b)
	{
		a = b;
		b = m;
	}
	printf("%d", b);
	return 0;
}

Expand ：

As long as we know the greatest common divisor m, Then the least common multiple =(a*b)/m

The greatest common multiple , Just a b The largest of the two numbers , Divide down one by one , Until the remainder is 0 The number of is the greatest common multiple