// Input an integer array a of size 15 from the user. The array can have multiple
// occurrences of elements. You have to remove the multiple occurences of elements
// and store the distinct elements in a new array. The memory for the new array
// has to be dynamically allocated using malloc such that its size is same as the
// number of distinct elements in A.
// 
// Authir:rahule@cse.iitk.ac.in

#include<stdio.h>
#include <stdlib.h>
#define n 15		//number of elements in the array

main()
{
  int a[n],i,j,cnt=1, *p;	//cnt is used to store the total number of distinct number in the given array
  printf("\nEnter the 15 integers :");
  for(i=0;i<n;i++)
    scanf("%d",&a[i]);
 
 /*Now we need to find the number of distinct elements in the array.We take each a[i] and compares it with all other elements a[j] an the array,
  * whenever a match is found,assign a[0] to a[j] so that,in future,when we see some a[i] with value a[0],we know that it has been already counted..
  */
    
  
  for(i=1;i<n;i++)	//note that we start from i=1,since a[0] has been already considered.(hence the cnt is initialized to 1)
  {
    if(a[i]==a[0])	//if a[i]=a[0],then a[i] has been already counted,becouse whenever we came across a repeated element,we had made it a[0]
      continue;
    
    cnt++;	//a[i] is a freash one.so increment cnt by 1
    for(j=i+1;j<n;j++)	//find all other instance of a[i] and make them a[0]
    {
      if(a[i]==a[j])
	a[j]=a[0];
    }
  }
//by the end of the above loop,every redundant elements in the array would be made as a[0]

  p=malloc(cnt*sizeof(int));	//now since we know the number of distinct elements,make an array p with cnt number of elements
  p[0]=a[0];
  
  for(i=1,j=0;i<n;i++)
  {
    if(a[i]!=a[0])	//whenever we come across a a[i] which is not equel to a[0],we store it in the new array p
    {
      j++;
      p[j]=a[i];
     }
  }
  //prints the new array
  printf("\nThe distict elements are, ");
  for(i=0;i<cnt;i++)
  printf("%d  ",p[i]);
}