Welcome to collectivesolver - Programming & Software Q&A. A website you can trust. All programs tested and works. Contact: aviboots(AT)netvision.net.il
Liquid Web Managed Dedicated Server: RAID 1 SSD with 16GB of RAM minimum! 24/7 On-Site Heroic Support! Industry-Leading SLA!

BlueHost Web Hosting

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

getflywheel wordpress hosting


Liquid Web Cloud VPS Hosting

8,512 questions

11,796 answers

573 users

How to insert sum of all existing values in unordered set using C++

1 Answer

0 votes
#include <iostream>  
#include <unordered_set>
#include <numeric>

using std::unordered_set;
using std::cout;
using std::endl;


void print(const unordered_set<int>& usset)
{
	for (const auto& element : usset) {
		cout << element << endl;
	}
	std::cout << std::endl;
}

int main()
{
	unordered_set<int> usset = { 1, 2, 3, 4, 5 };

	usset.insert(accumulate(usset.begin(), usset.end(), 0));

	print(usset);

	return 0;
}

/*
run:

1
2
3
4
5
15

*/

 




answered Jan 13 by avibootz
edited Jan 15 by avibootz
...