// Written in response to a question // https://www.sololearn.com/Discuss/2048727/?ref=app #include #include // std::sort #include // std::greater int input(const char* prompt, int n = 0) { int rv {0}; printf(prompt, n); // if(1 != scanf("%d", &rv)) return 0; std::cin >> rv; // CPG input if(!std::cin.good()) std::cin.ignore(); printf("%d\n", rv); // CPG output return rv; } void print_array(const char* title, const int* arr, const size_t size) { printf("%s {%d", title, arr[0]); for(size_t i {1}; i < size; printf(", %d", arr[i++])); printf("}\n"); } int sum_of_digits(int n) { if(!n) return 0; int rv {0}; for(; n; rv += n % 10, n /= 10); return rv; } int main() { using std::cout; using std::cin; // Read number of samples int n = input("Number of samples: "); if(n <= 0) return 0; // Invalid // Create array of elements // Input numbers // Sum of digit for each input int* numbers = new int[n]; int* sums = new int[n]; // Read first element of // array. Assume the // first element and sum of its // digit as minimum numbers[0] = input("\nSample 1: "); sums[0] = sum_of_digits(numbers[0]); int res[] {numbers[0], sums[0]}; for(int i {1}; i < n; i++) { numbers[i] = input("Sample %d: ", i + 1); // Sum of digits in numbers[i] sums[i] = sum_of_digits(numbers[i]); // Check for the number having // minimum sum of digits if(sums[i] < res[1]) { res[0] = numbers[i]; res[1] = sums[i]; } } // Display array print_array("\nInput numbers", numbers, n); // Display number with minimum sum of digit printf("* Minimum digit sum: %d (sum: %d)\n", res[0], res[1]); // Display before sorting cout << "\nSum of digit for each numbers:\n"; print_array("* Pre sorting ", sums, n); // Sort in descending order std::sort(sums, sums + n, std::greater()); // Display after sorting print_array("* Post sorting", sums, n); // Free resources delete []numbers; delete []sums; return 0; }

QA-2048727-Sum digits of number