Търсене на брой на еднакви числа в масив .cpp

#include<stdio.h>
#include<string.h>

int main()
{
  int arr[] = {15, 32, 41, 43, 44, 48, 5, 10, 12, 28, 31, 32, 17, 22, 25 ,26 ,46 ,49, 2, 3, 11, 13, 44, 45, 8, 13, 24, 35, 39, 45, 1, 7, 19, 23, 28, 32, 11, 14, 15, 16, 44, 17, 1, 5, 10, 20, 32, 39, 1, 3, 5, 12, 37, 44, 1, 7, 24, 33, 45, 48, 15, 19, 31, 33, 40, 42, 5, 20, 28, 30, 33, 49, 8, 17, 29, 31, 34, 37, 7, 18, 23, 31, 35, 37, 6, 19, 33, 34, 36, 49, 11, 16, 18, 35, 38, 49, 5, 13, 21, 27, 28, 32, 14, 18, 19, 24, 30, 44, 3, 6, 27, 29, 30, 40, 15, 27, 32, 33, 43, 49, 2, 13, 16, 17, 18, 43, 6, 9, 19, 34, 47, 49, 13, 18, 22, 31, 44, 49, 11, 14, 16, 42, 47, 48, 17, 23, 28, 33, 35, 47, 8, 12, 16, 23, 25, 41};
  int arrSize = sizeof(arr)/sizeof(arr[0]);
  int tracker[80];
  int i,j,k=0,l=0,count,exists=0;

  for (i=0;i<arrSize;i++)
    printf("%d\t", arr[i]);
  printf("\n");

  memset(tracker, '$', 80);

  for (i=0, j=i+1, count=1, l=0; i<arrSize; i++)
  {
    j=i+1;
    count=1;
    l=0;

    while (l < arrSize)
    {
      if (arr[i] == tracker[l])
      {
        exists = 1;
        break;
      }
      l++;
    }

    if (1 == exists)
    {
      exists = 0;
      continue;
    }

    while (j < arrSize)
    {
      if (arr[i] == arr[j])
        count++;
      j++;
    }
    tracker[k] = arr[i];
    k++;

    printf("Числото %d се е падало %d пъти!\n", arr[i], count);
  }

}