Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,907 questions

51,839 answers

573 users

How to count all distinct pairs from array with specific difference between them in C++

1 Answer

0 votes
#include <iostream> 

int countPairsWithSpecificDifference(int arr[], int size, int difference) { 
    int count = 0; 
      
    for (int i = 0; i < size; i++) {        
        for (int j = i + 1; j < size; j++) {
            if (arr[i] - arr[j] == difference || arr[j] - arr[i] == difference) {
                  count++; 
            }
        }
    } 
    return count; 
} 
  
int main() 
{ 
    int arr[] = {25, 16, 8, 12, 20, 17, 0, 4, 21, 26}; 
    int difference = 4; 

    // 7 pairs with difference 4: {25, 21}, {16, 12}, {16, 20}, {8, 12}, {8, 4}, {17, 21} {0, 4} 

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

    std::cout << countPairsWithSpecificDifference(arr, size, difference); 
    
    return 0; 
} 




/*
run:
  
7
  
*/

 



answered Nov 30, 2021 by avibootz
...