gcd lcm version 2.c

#include<stdio.h>
#include<stdlib.h>
int filter(const void * b,const void* a)
{
  return (*(int *)b - *(int *)a);
}
int gcm(int a,int b)
{
    int i;
    while(b!=0)
    {
    int temp;
    temp=b;
    b=a%b;
    a=temp;
    }
    return a;
}

int lcm(int a,int b)
{
    return (a*b)/gcm(a,b);
}

int main()
{
    int count=0;
    int capacity=1;
    int *arr=(int*)malloc(capacity*sizeof(int));
    int input,i,b;
    printf("ENTER:");
    while(scanf("%d",&input)==1 )
    {
        if(count==capacity)
        {
            arr=(int*)realloc(arr,capacity*2*sizeof(int));
        }
        arr[count++]=input;
    }
   qsort(arr, count, sizeof(int), filter);
   int a=arr[0];
   int l=arr[0];
   for (i=1;i<count;i++)
   {
       int b=arr[i];
       a=gcm(a,b);
       l=lcm(l,b);
      }
    printf("GCD VALUE: %d\n",a);
   //LCM

   printf("lcm VALUE: %d",l);


   free(arr);

}