Count distinct pairs from two arrays having same sum of digits in C++

We are given with two arrays let’s say, arr_1[] and arr_2[] having integer values and the task is to calculate the count of distinct pairs having the same sum of digits. It means, one value should be selected from an arr_1[] and second value from arr_2[] to form a pair and both the values should have the same sum digits.Arrays a kind of data structure that can store a fixed-size sequential collection of elements of the same type. An array is used to store a collection of data, but it is often more useful to think of an array as a collection of variables of the same type.<h2>For Example</h2><pre class="result notranslate">Input − int arr_1[] = {1, 22, 42, 17}    Int arr_2[] = {1, 31, 6, 8} Output − count is 4</pre>Explanation − in total there are 4 pairs having the same sum of digits and those are (1, 1), (22, 31), (42, 6) and (17, 8).<pre class="result notranslate">Input − int arr_1[] = {1, 22, 42, 17}    Int arr_2[] = {2, 78, 6, 18} Output − count is 1</pre>Explanation − in total there is only one pair having the same sum of digits and that is (42, 6).<pre class="result notranslate">Input − int arr_1[] = {1, 22, 42, 17}    Int arr_2[] = {2, 78, 16, 18} Output − count is 0</pre>Explanation − There is no pair having the same sum of digits so count is 0.<h2>Approach used in the below program is as follows −</h2><ul class="list"><li>Create two arrays let’s say, arr_1[] and arr_2[]</li><li>Calculate the length of both the arrays using the length() function that will return an integer value as per the elements in an array.</li><li>Create a set type variable let’s say st</li><li>Start loop for i to 0 and i less than size of arr_1[]</li><li>Inside the loop, Start another loop for j to 0 and j less than size of arr_2[].</li><li>Check if Sum(arr[i]) = sum(arr_2[j]) then check if arr_1[i] less than arr_2[j] then insert(make_pair(arr_1[i], arr_2[j])</li><li>Else, insert(make_pair(arr_2[j], arr_1[i]).</li><li>Return st.size()</li><li>Print the result.</li></ul><h2>Example</h2><a class="demo" href="http://tpcg.io/kSEd8k7L" rel="nofollow" target="_blank"> Live Demo</a><pre class="prettyprint notranslate">#include <iostream> #include <set> using namespace std; // Function to find the // sum of digits of a number int sumdigits(int n){    int sum = 0;    while (n > 0){       sum += n % 10;       n = n / 10;    }    return sum; } //function to count the number of pairs int paircount(int arr_1[], int arr_2[], int size1, int size2){    // set is used to avoid duplicate pairs    set<pair<int, int> > myset;    for (int i = 0; i < size1; i++){       for (int j = 0; j < size2; j++){          // check sum of digits          // of both the elements          if (sumdigits(arr_1[i]) == sumdigits(arr_2[j])){             if (arr_1[i] < arr_2[j]){                myset.insert(make_pair(arr_1[i], arr_2[j]));             } else{                myset.insert(make_pair(arr_2[j], arr_1[i]));             }          }       }    }    // return size of the set    return myset.size(); } // Driver code int main(){    int arr_1[] = { 1, 22, 42, 17 };    int arr_2[] = { 5, 31, 6, 8 };    int size1 = sizeof(arr_1) / sizeof(arr_1[0]);    int size2 = sizeof(arr_2) / sizeof(arr_2[0]);    cout <<"count is "<<paircount(arr_1, arr_2, size1, size2);    return 0; }</pre><h2>Output</h2>If we run the above code we will get the following output &miuns;<pre class="result notranslate">count is 3</pre>

Sunidhi Bansal

Updated on 15-May-2020 11:57:58

Previous Page Print Page Next Page