分别求两个整数的最大公约数

privatesubform_click()n=val(text1)m=val(text2)ifn

你的c语言写的好乱,我帮你整理如下：#include "stdio.h"int gcd(int a,int b){  &

packagecom.fmzrt;/***求两个数的最大公约数和最小公倍数*@authorkele**/publicclassGongyueGongbeiShu{/***求两个数的最大公约数*@par

#includeintgongyue(intm,intn){intr;if(m==n)returnm;elsewhile((r=m%n)!=0){m=n;n=r;}returnn;}intgongbe

#includeintgongyue(intm,intn){intr;if(m==n)returnm;elsewhile((r=m%n)!=0){m=n;n=r;}returnn;}voidmain(

include"stdio.h"intgongyue(inta,intb);intgongbei(inta,intb);voidmain(){inta,b,temp,gy,gb;clrscr();pr

275和385最大公约数55,得到的伤分别5,7.

你的题目好像少了些什么提问者好像少给出两商之和..再问：没少再答：你的两商之和没有给啊

PrivateSubCommand1_Click()DimSAsLongS=YueOrBei(24,32)MsgBox"24和32的最大公约数是："&S,vbInformationS=YueOrBei

1925=5×5×7×11；两个商都是1925的因数且互质，而且和为16，所以这两个商分别为5和11；这两个整数分别是：1925÷5=385，1925÷11=175；答：这两个整数分别是385与175

intmax_common_divisor(inta,intb){//最大公约数intlarge_num,small_num,r;if(a>b){large_num=a;small_num=b;}el

#includeintmaxY(intm,intn){inti;for(i=n;i>0;i--)if(m%i==0&&n%i==0)break;return(i);}intminB(intm,intn

#includevoidmain(){inthcf(int,int);intlcd(int,int,int);intu,v,h,l;scanf("%d,%d",&u,&v);h=hcf(u,v);pr

include"stdio.h"intgongyue(inta,intb);intgongbei(inta,intb);voidmain(){inta,b,temp,gy,gb;clrscr();pr

#includeintmain(){inta,b,imax,imin,tend;intmax(int,int);printf("pleaseinserttwonumbers:");scanf("%d%

例子一:#includevoidmain(){voidz1(inta,intb);intx,y,temp;scanf("%d%d",&x,&y);if(x

#include"stdio.h"voidmain(){\x05intnum1,num2,temp,a;\x05printf("pleaseinputtwonumbers:\n");\x05scanf

1092=2×2×3×7×137+13=202×2×3×7=842×2×3×13=156这两个整数分别是84和156

①#includeinthcf(inta,intb){\x09intc;\x09while(b){c=b;b=a%b;a=c;}\x09returna;}intlcd(inta,intb,intc){

完整程序如下：#includefun(intx,inty){intr;if(x>y){x=x;y=y;}r=x;x=y;y=r;r=x%y;while(r!=0){x=y;y=r;r=x%y;}ret