#include <iostream> #include <list> int main() { int n; std::cin >> n; std::list<int>::iterator it; std::list<int> mylist; int temp; for (int i = 0; i < n; i++) { std::cin >> temp; mylist.push_front(temp); } mylist.sort(); bool wasMerged = true; while(wasMerged) { wasMerged = false; int current; int next; if(mylist.size() > 1) { for (it = mylist.begin(); it != --mylist.end(); ++it) { current = *it; next = *++it; it--; if (current == next) { int a = *it; mylist.push_back(++a); it = mylist.erase(it); it = mylist.erase(it); wasMerged = true; } } mylist.sort(); } } std::cout << *--mylist.end(); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | #include <iostream> #include <list> int main() { int n; std::cin >> n; std::list<int>::iterator it; std::list<int> mylist; int temp; for (int i = 0; i < n; i++) { std::cin >> temp; mylist.push_front(temp); } mylist.sort(); bool wasMerged = true; while(wasMerged) { wasMerged = false; int current; int next; if(mylist.size() > 1) { for (it = mylist.begin(); it != --mylist.end(); ++it) { current = *it; next = *++it; it--; if (current == next) { int a = *it; mylist.push_back(++a); it = mylist.erase(it); it = mylist.erase(it); wasMerged = true; } } mylist.sort(); } } std::cout << *--mylist.end(); return 0; } |