1. 编写一个自定义函数Gcd(m,n),实现求m和n两个正整数的最大公约...答:n=mod(n,m)直到零位置的非零值。例如:include <stdio.h> int gcd, lcm;int m,n;void fun(void){ int a=m, b=n,t;while(b){ t=a%b;a=b;b=t;} gcd=a;lcm=m/a*n;} int main(){ scanf("%d%d",&m,&n);fun();printf("%d and %d 's gcd is %d, lcm is %d\n",...