/* Sorting Arrays by the Amount of Perfect Squares that Each Element May Generate When we have two or more numbers with the same amount of perfect squares in their permutations, we sorted by their values. First enter the amount you want to enter Then enter the values ex. 6 234 61 16 441 144 728 Or 6 234 61 16 441 144 728 Output 144 441 16 61 234 728 */ #include #include #include //Because these implementations are bugged on sololearn I'll just implement my own namespace myOwnStd { template std::string to_string(T __x) { std::stringstream ss; ss << std::fixed << __x; return ss.str(); } int stoi(const std::string& __s) { int r = 0, x = 1; for(auto it = __s.rbegin(); it != __s.rend(); ++it, x*=10) { r += (*it - '0') * x; } return r; } } int count_perf_squares(int num) { std::string s = myOwnStd::to_string(std::abs(num)); std::string temp = s; int count = 0; do { std::next_permutation(temp.begin(), temp.end()); int n = myOwnStd::stoi(temp); int squareRoot = std::round(std::sqrt(n)); if(squareRoot * squareRoot == n) { ++count; } }while(temp != s); return count; } int main() { std::vector arr; int amount; std::cin >> amount; for(int i = 0; i < amount; ++i) { int temp; std::cin >> temp; arr.push_back(temp); } std::sort(arr.begin(), arr.end(), [](int a, int b) { int c = count_perf_squares(a); int d = count_perf_squares(b); return ((c == d) ? a < b : c > d); }); for(const auto& i : arr) { std::cout << i << " "; } return 0; }

Sorting challenge