当前位置：网站首页>C language to find the greatest common divisor and the least common multiple of two numbers

C language to find the greatest common divisor and the least common multiple of two numbers

2022-07-21 18:23:00 【p29949】

division Also known as Euclidean algorithm , Is a way to find the greatest common divisor . Its concrete method is ： Divide the larger number by the smaller number , And then the remainder that appears （ The first remainder ） Remove divisor , And then the remainder that appears （ Second remainder ） Remove the first remainder , So again and again , Until the end, the remainder is 0 until . If you want to find the greatest common divisor of two numbers , So the final divisor is the greatest common divisor of these two numbers .

Method for finding maximum common divisor ： division

Method of finding the least common divisor ：(a x b)÷ greatest common divisor 

#include <stdio.h>
int main()
{
	int a,b;
	int c = 0;
    scanf("%a %b",&a,&b);
	while (c = a % b) 
	{
		a = b;
		b = c;
	}
	printf("%d Is the greatest common divisor ", b);
    return 0;
}
原网站

版权声明
本文为[p29949]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/202/202207210117567755.html

边栏推荐

猜你喜欢

随机推荐