C language · Least common multiple

Problem description Write a function LCM to find the least common multiple of two positive integers. Sample input An input example that satisfies the requirements of the topic.
Cases:
3 5 Sample output corresponds to the output of the sample input above.
Cases:
Data size and convention the range of each number in the input data.
Example: Two numbers are less than 65536.method One:

/*
Seeking greatest common divisor by phase subtraction
least common multiple = Two integer of the Product ÷ greatest common divisor;
*/
#include <stdio.h>
int main () {
int m,n,a,b,c;
scanf ("%d%d", &m,&n);
A=m;
B=n;
while (a!=b) {
if (a>b) {
A = a-B;
} else {
b = b-a;
}
}
printf ("Greatest common divisor is a or B, i.e.:%d", a);
printf ("Least common multiple is m*n/b, i.e.:%d", m*n/a);
}

Method Two:

/* least common multiple = Two integer of the Product ÷ greatest common divisor */
#include <stdio.h>
int main () {
int m,n,a,b,c;
scanf ("%d%d", &m,&n);
A=m;
B=n;
while (b!=0) {
C=a%b;
A=b;
B=c;
}
printf ("%d", m*n/a);
}

C language · Least common multiple