#include #include #include using namespace std; int main() { int arr[] = {1,2,3,4,5,6,7,8,9,13,15,17,19,22,23,29,31,37,39,44,47,56,87,93,97,101,103,176,189,275,299,309,387,447,493}; int G = 2000; vector vecar; vector calc; int sum = 0; for (auto x : arr) vecar.push_back(x); sort(vecar.begin(),vecar.end()); cout << "MATCHES IN ASCEND VECTOR!" << endl; for (int x = 0; x < vecar.size(); x++) { sum = 0; for (int y = 0; y < vecar.size(); y++) { sum+=vecar[y]; calc.push_back(vecar[y]); if(sum > G){sum-=vecar[y];calc.pop_back();} if(sum==G) { sort(calc.begin(),calc.end()); for(int z = 0; z < calc.size(); z++) cout << calc[z] << "-"; cout << endl << endl; break; } } vecar.push_back(vecar[0]); vecar.erase(vecar.begin()); calc.clear(); } cout << endl << endl; sort(vecar.begin(),vecar.end()); reverse(vecar.begin(),vecar.end()); cout << endl; cout << "MATCHES IN DESCEND VECTOR" << endl; for (int x = 0; x < vecar.size(); x++) { sum = 0; for (int y = 0; y < vecar.size(); y++) { if(vecar[y]>G){break;} sum+=vecar[y]; calc.push_back(vecar[y]); if(sum > G){sum-=vecar[y];calc.pop_back();} if(sum==G) { sort(calc.begin(),calc.end()); reverse(calc.begin(),calc.end()); for(int z = 0; z < calc.size(); z++) cout << calc[z] << "-"; cout << endl << endl; break; } } vecar.push_back(vecar[0]); vecar.erase(vecar.begin()); calc.clear(); }}

another g subset