C-language function calls 03-greatest common divisor and least common multiple

Function call/*====================================================== title: Ask for two numbers of greatest common divisor and least common multiple. For example: 16 and 12 of the greatest common divisor are: 4    16 and 12 of least common multiple are: 48======================================================*/#include < Stdio.h>int GY (int m,int n) {int t,r;if (n>m) {t=m;m=n;n=t;} while ((r=m%n)!=0) {m=n;n=r;} return (n);} int GB (int m,int n) {int k;k=m*n/gy (m,n); return (k);} Main () {int x,y,gys,gbs;printf ("input two: \ n"), scanf ("%d%d", &x,&y), Gys=gy (x, y), GBS=GB (x, y);p rintf ("%d and% The greatest common divisor of D is:%d\n ", X,y,gys);p rintf ("%d and%d least common multiple are:%d\n ", X,y,gbs);} /*========================================================= review: By writing two functions independently gb-least common multiple and gy-for greatest common divisor, making the program very compact and very good maintenance and inspection. =========================================================

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

C-language function calls 03-greatest common divisor and least common multiple