#include #include #include #include using namespace std; map, int> val; vector> find_valid_combination(vector> no) { vector> v; for (size_t j = 0; j < no.size(); j++) { vector n = no[j]; size_t flag = 0; for (size_t i = 1; i < n.size(); i += 2) if (n[i] <= n[i - 1]) flag++; if (flag == n.size() / 2) v.push_back(n); } return v; } void min_modulus(vector> v) { for (size_t j = 0; j < v.size(); j++) { vector n = v[j]; int sum = 0; for (size_t i = 1; i < n.size(); i += 2) sum += (n[i - 1] % n[i]); val.insert({ n, sum }); } } int main() { vector> tc = { {1,2,3,3} , {4,16,19,6}, {9,4,6,3}, {1,2,3,4,5,6}, {1,2} }; cout << "Minimum sum of remainders:\n"; for (auto in : tc) { vector> tmp; sort(in.begin(), in.end()); do { vector tm; for (size_t i = 0; i < in.size(); i++) tm.push_back(in[i]); tmp.push_back(tm); } while (next_permutation(in.begin(), in.end())); min_modulus(find_valid_combination(tmp)); auto min_mod = min_element(val.begin(), val.end(),[](const auto& l, const auto& r) { return l.second < r.second; }); //printing output for (size_t i = 0; i < in.size(); i++) cout << (i == 0 ? "[" : "") << in[i] << (i == in.size() - 1 ? "]\n" : ","); for (size_t l = 0; l < in.size(); l++) cout << (l==0?"(":"") << (l%2 == 0 && l!=0 ? ")+(" : "") << min_mod->first[l] << (l%2==0?"%":"")<<(l == in.size() - 1 ? ")" : ""); cout << " = " << min_mod->second << "\n\n"; val.erase(val.begin(), val.end()); } }

min mod sum