1028:c Language Programming Tutorial (third Edition) after class exercise 8.1 using functions to find the number of conventions

The title description writes two functions, each for two integers greatest common divisor and least common multiple, calls these two functions with the main function, and outputs the result two integers by the keyboard input. Input two-digit output greatest common divisor least common multiple sample input

6 15

Sample output

3 30

Hint Source

int main() { int a,m,n,cun,bei; scanf ( "%d %d" ,&m,&n); a=m*n; if (m<n)cun=m,m=n,n=cun; while (n!=0) {      cun=m%n;      m=n;      n=cun; } bei=a/m; printf ( "%d %d" ,m,bei); return 0; }

1028:c Language Programming Tutorial (third Edition) after class exercise 8.1 using functions to find the number of conventions