Question

given an array of integers a, your task is to count the number of pairs i and j (where 0 ≤ i < j < a.length), such that a[i] and a[j] are digit anagrams. two integers are considered to be digit anagrams if they contain the same digits. in other words, one can be obtained from the other by rearranging the digits (or trivially, if the numbers are equal). for example, 54275 and 45572 are digit anagrams, but 321 and 782 are not (since they don't contain the same digits). 220 and 22 are also not considered as digit anagrams, since they don't even have the same number of digits.

Answer 1

Using the knowledge of computational language in C++ it is possible to write a code that given an array of integers a, your task is to count the number of pairs i and j.

Writting the code:

// C++ program for the above approach

#include <bits/stdc++.h>

using namespace std;

// Function to find the count required pairs

void getPairs(int arr[], int N, int K)

{

   // Stores count of pairs

   int count = 0;

   // Traverse the array

   for (int i = 0; i < N; i++) {

       for (int j = i + 1; j < N; j++) {

           // Check if the condition

           // is satisfied or not

           if (arr[i] > K * arr[j])

               count++;

       }

   }

   cout << count;

}

// Driver Code

int main()

{

   int arr[] = { 5, 6, 2, 5 };

   int N = sizeof(arr) / sizeof(arr[0]);

   int K = 2;

   // Function Call

   getPairs(arr, N, K);

   return 0;

}

See more about C++ code at brainly.com/question/17544466

#SPJ4