C语言实现求解最小公倍数的算法示例

#include <stdio.h>


int Get_Min_Comm_Multiple(int num1, int num2)
{
    int i = 0, tmp = 0, mul = 0;
    tmp = num1 > num2 ? num1 : num2; //获取最大值
    mul = num1 * num2;   //两数之积
    for(i = tmp; i <= mul; i++)
    {
        //同时为num1和num2的倍数
        if(i % num1 == 0 && i % num2 == 0)
            break;
    }
    return i;
}

int main()
{
    int num1, num2;

    printf("请输入两个正整数\n");
    scanf("%d%d", &num1, &num2);
    printf("它们的最小公倍数为：%d\n",Get_Min_Comm_Multiple(num1, num2));
    return 0;
}

#include <stdio.h>


int Get_Max_Comm_Divisor(int num1, int num2)
{
    int remainder = num1 % num2;  //余数

    while(remainder != 0)
    {
        num1 = num2;      //更新被除数
        num2 = remainder; //更新除数
        remainder = num1 % num2; //更新余数
    }
    return num2;  //最后的除数即为最大公因数
}


int Get_Min_Comm_Multiple(int num1, int num2)
{
    
    return num1 * num2 / Get_Max_Comm_Divisor(num1, num2);
}

int main()
{
    int num1 = 0, num2 = 0;

    printf("请输入两个正整数\n");
    scanf("%d%d", &num1, &num2);
    printf("它们的最小公倍数为：%d\n", Get_Min_Comm_Multiple(num1, num2));
    return 0;
}