Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- #include <conio.h>
- int find_min(int &n){
- int k = n;
- int cpow = 0;
- int rpow = 0;
- int min = 10;
- while (k != 0)
- {
- int temp = k % 10;
- cpow++;
- if (temp < min)
- {
- min = temp;
- rpow = cpow;
- }
- k /= 10;
- }
- n = n / int(powf(10, rpow)) * int(powf(10, rpow - 1)) + n % int(powf(10, rpow - 1));
- return min;
- }
- int main(){
- int n, m = 0;
- printf("Nhap n: ");
- scanf_s("%d", &n);
- while (n != 0)
- {
- int k = find_min(n);
- m = m * 10 + k;
- }
- printf("So sao khi su li la: %d", m);
- _getch();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement