N个数的最小公倍数

#include<stdio.h>
   int main()
   {
       int n,q;
       int a[100];
       while(scanf("%d",&n)!=EOF)
       {
           int i,j,h;
           for(i=0;i<n;i++)
           {
               scanf("%d",&a[i]);
           }
           int max=0,f;
           for(i=0;i<n;i++)
           {
               if(a[i]>=max)
               {
                   max=a[i];
                   f=i;
               }
           }
            q=0,j;
           for(j=1;;j++)
           {
               q=0;
               for(i=0;i<n;i++)
               {
                   if((a[f]*j)%a[i]!=0)
                   {
                   q=1;
                   break;
                   }
               }
               if(q==0)
               {
                   printf("%d\n",a[f]*j);
                   break;
               }
           }

       }
       return 0;