C language-seeking greatest common divisor and least common multiple

////MAIN.C//Shuzu_gongyushu////Created by jereh123 on 15/7/22.//Copyright (c) 2015 jerehedu. All rights reserved.//#include <stdio.h>//Greatest common divisorintGetmaxcommondivisor (intNUM1,intNUM2);intGetmaxcommondivisor (intNUM1,intNUM2) {//num1 Save a larger number num2 save a smaller number    intTEMPN;if(NUM1&LT;NUM2)        {tempn=num1;        num1=num2;    NUM2=TEMPN; }//8     while(num2!=0) {tempn=num1%num2;        num1=num2;    NUM2=TEMPN; }returnNUM1;}//least common multiple-two multiplication/greatest common divisorintGetmincommonmultiple (intNUM1,intNUM2);intGetmincommonmultiple (intNUM1,intNUM2) {returnNum1*num2/getmaxcommondivisor (NUM1, num2);}intMainintargcConst Char* argv[]) {intnum1,num2;printf("Input 2 number:");scanf("%d%d", &num1,&num2);printf("This 2 Numer ' s maxcommondivisor is:%d\n", Getmaxcommondivisor (num1,num2));printf("This 2 Numer ' s mincommonmultiple is:%d\n", Getmincommonmultiple (num1,num2));return 0;}

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

C language-seeking greatest common divisor and least common multiple