#include {int gongyueshu(m,n); int gongbeishu(m,n); int m,n,j,i; printf(\"请输入m,n:\"); scanf(\"%d,%d\ j=gongyueshu(m,n); i=gongbeishu(m,n); printf(\"最大公约数为%d\\n\ printf(\"最小公倍数为%d\\n\ printf(\"赵才茂 1144022011\\n\"); return 0; } int gongyueshu(m,n) { int x1,x2,a,b,c,j; x1=1;x2=1; c=(m>n)?m:n; while(x1<=c) { if(m%x1==0&&n%x1==0) {a=x1;} x1++;} return a; } int gongbeishu(m,n) { int x1,x2,a,b,c; x1=1;x2=1; c=(m>n)?m:n; while(x1<=c) { if(m%x1==0&&n%x1==0) {a=x1;} x1++; } if(a!=1) { while(m*x2%n!=0) { x2++; } b=m*x2; } else b=m*n; return b; } 因篇幅问题不能全部显示，请点此查看更多更全内容