Yuan-Fu Luo

#include <stdio.h>
#include <stdlib.h>
gcd(int a, int b)
{
   if (a == 0)
        return b;
   if (b == 0)
       return a;
   if (a < b)
   {
      int tmp = a;
      a = b;
      b = tmp;
   }
   while (b != 0)
   {
      int tmp = a % b;
      a = b;
      b = tmp;
   }
  return a;
}

int main(void)
{
   int a,b,x,n,i,num;
   printf("欲計算最小公倍數的數字個數:");
   scanf("%d",&n);
   printf("第1個數字:");
    scanf("%d",&num);
   for(i=2;i<=n;i++)
   {
   printf("第%d個數字:",i);
    scanf("%d",&x);
    num=x*num/gcd(x,num);
    printf("目前%d個數字之最小公倍數為:%d\n",i,num);
    }
    system("pause");
return 0;
}