C language: Little Lele and Euclid

Topic link
Xiao Lele recently learned in class how to find the maximum common divisor and minimum common multiple of two positive integers , But he can't find the sum of the maximum common divisor and the minimum common multiple of two positive integers , Please help him solve the problem .

#include<stdio.h>
int main()
{
    
    long long n=0;
    long long m=0;
    scanf("%d %d",&n,&m);
    long long t1=n;
    long long t2=m;
    while(n%m!=0)
    {
    
        long long  tmp=n;
        n=m;
        m=tmp%m;
    }
    // Finish walking above while Got m Is the greatest common divisor 
    printf("%lld",m+t1*t2/m);
    // Print here with lld In the form of printing , Otherwise, plastic printing will still overflow 
}

Here we use the rolling division method to obtain the maximum common divisor
Minimum common multiple = primary m* primary n/ greatest common divisor , This proof is in another article of mine ,
Given the greatest common divisor, quickly find the least common multiple （ Attached certificate ）

It should be noted that , The range of numbers here is [1,2^20], When calculating the least common multiple , Because of the original m* primary n So it will be very big , Do you use int It's bound to overflow , To prevent spillage , Here we simply use long long that will do .