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