/*用輾轉(zhuǎn)相除法求以0結(jié)尾的自然數(shù)序列的最大公約數(shù)   */   
  unsigned   int   commondivisor(unsigned   int   param[])   
  {   
        int   i=0,a=param[0],b;   
        if(!a   )return   0;   
        while(b=param[++i]   )   
        {   
            while(a   &&   b)   
            {   
                a>b?   (a   %=   b):(   b   %=   a);   
            }   
            a+=b;   
        }   
        return   a;   
  }   
    
  /*用輾轉(zhuǎn)相乘法求以0結(jié)尾的自然數(shù)序列的最小公倍數(shù)   */   
  unsigned   int   commondivisee(unsigned   int   param[])   
  {   
        int   i=0,a=param[0],b;   
        while(b=param[++i]   )   
        {   
            while(b   &&   a   &&   b   !=   a)   
            {   
                b   >   a?   (   a   *=   b   /   (   (b-1)   %a   +   1   )   ):   (   b   *=   a   /(   (a-1)%b+1   ));   
            }   
        }   
        return   a;   
  }   
  main()   
  {   
        unsigned   int   t[]={18,6,240,0};   
        unsigned   int   v[]={0,12,0};   
        printf("{18,6,240,0}--%d,%d\n",commondivisor(t),commondivisee(t));   
        printf("{0,240,0}--%d,%d\n",commondivisor(v),commondivisee(v));   
  }