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 find all combinations of three elements in an array whose sum is equal to N in C++

1 Answer

0 votes
#include <iostream>
 
void PrintThreeElements(int arr[], int size, int N) {
    for (int i = 0; i < size; i++) {
        for (int j = i + 1; j < size; j++) {
            for (int k = j + 1 ; k < size; k++) {
                if (arr[i] + arr[j] + arr[k] == N) {
                   std::cout << arr[i] << " " << arr[j] << " " << arr[k] << "\n";
                   break;
                }
            }
        }
    }
}
 
int main()
{
    int arr[] = {3, 2, 6, 4, 10, 5, 9, 7, 8, 12};
    int N = 24;
    int size = sizeof(arr)/sizeof(arr[0]); 
 
    PrintThreeElements(arr, size, N);
}
 
 
 
 
/*
run:
 
3 9 12
2 10 12
6 10 8
4 8 12
10 5 9
5 7 12
9 7 8
 
*/

 

 



answered Sep 7, 2022 by avibootz
...