/* Author : ~swim~ Date : 05-May-2018 Description : Remove Smallest Digits (Assignment) Hey, Generate a list of random digits from 0-9 and remove the next smallest digits(s) from the list untill you are left with the largest single digits(s). (As an extra show digits removed from list) Example User Inputs 10 (10 random digits are generated) 1537262627 (1) ->Removed 537262627 (2,2,2)->Removed 537667 (3)->Removed 57667 (5)->Removed 7667 (6,6)->Removed 77 (7,7) -> Largest Digits Thanks 👍 Input : Enter a positive integer greater or equal to 1 and press submit. The integer denotes number of random numbers to be generated. */ #include #include #include #include #include using namespace std; int main() { // initialize the random number // generator srand(time(nullptr)); // number of random numbers to be // generated int ncount{}; cin >> ncount; if(ncount < 1) { cout << "error, enter a number" " >= 1"; return -1; } string nlist; nlist.reserve(ncount); set num_set; // generate random numbers and // store them in a set. // also generate string out of // the digits; for(int i{}; i " << n << " " << "num = "; nlist = nlist.substr(0, it - nlist.begin()); Print(nlist); cout << "\n"; }// end for(auto&& n:num_set) cout << "Number already maximum" " or no more removal possible\n"; }// end for(auto&& n:num_set)

Remove_smallest_digits.cpp