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,933 questions

51,870 answers

573 users

How to find all pairs in a vector that equal to a given sum in C++

1 Answer

0 votes
#include <vector>
#include <iostream>

void findAllPairs(std::vector<int> &arr, int sum) {
	bool found = false;
	
	for (int i = 0; i < arr.size() - 1; i++) {
		for (int j = i + 1; j < arr.size(); j++) {
			if (arr[i] + arr[j] == sum) {
				std::cout << "arr[" << i << "](" << arr[i] << ") + " << "arr[" << j << "](" << arr[j] << ")" << "\n";
				found = true;
			}
		}
	}
	if (!found) {
		std::cout << "Pair not found" << "\n";
	}
}

int main() {
	std::vector<int> arr = {2, 4, 1, 5, 6, 8, 1};
	int sum = 10;

	findAllPairs(arr, sum);
}





/*
run:
 
arr[0](2) + arr[5](8)
arr[1](4) + arr[4](6)
 
*/

 



answered Oct 10, 2022 by avibootz
edited Apr 16, 2023 by avibootz

Related questions

1 answer 91 views
1 answer 191 views
1 answer 149 views
1 answer 161 views
1 answer 138 views
...