/* CHALLENGE : REARRANGING THE DIGITS Task: Find the smallest number (not leading zeros) and largest number which can be obtained by rearranging the digits of given number (positive integer). For example: Input: 300591 Output: 100359 smallest 953100 largest https://code.sololearn.com/c4p2nSUQdKAG/?ref=app */ #include using namespace std; void Rrng (unsigned long long int num ){ ////////////////////////////////////Rrng()/Extraction.. int i , Amount=0; unsigned long long int TempNum = num; while ( TempNum>=1 ) { TempNum/=10; Amount++; // number of digits } int Figures[Amount]; for(i=0 ; i< Amount ; i++){ // extracting Figures[i]=num%10; num/=10; } unsigned long long int Notation = 1; // 10^amount for(i=1 ; i0 ; TempNum/=10){ // the others figures SmallerFigureLeft=9; for (i=0 ; i< Amount ; i++){ if (Figures[i]<=SmallerFigureLeft && Figures[i]<10){ SmallerFigureLeft=Figures[i] ; index=i; } } Figures[index]+=10; Smallest+=TempNum * SmallerFigureLeft ; } cout<<"Rearranged smallest= "<0 ; TempNum/=10){ SmallerFigureLeft=0; for (i=0 ; i< Amount ; i++){ if (Figures[i]%10>=SmallerFigureLeft && Figures[i]<20){ SmallerFigureLeft=Figures[i]%10 ; index=i; } } Figures[index]+=10; Biggest+=TempNum * SmallerFigureLeft ; } cout<<"Rearranged biggest= "<>a; cout<<"Your digit: "<

CHALLENGE rearranging the digits