Function to find the number with largest composite product of digits from the indices not divisible by k from the given array
int largestCompositeDigitProduct ( int a [ ] , int n , int k ) { vector < pair < int , int > > pq ;