代码如下,注意按照要求,不够的位数要用零补齐!
输入1:
6767
输出1:
7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174
输入2:
2222
输出2:
2222 - 2222 = 0000
#include<stdio.h>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
return a>b;
}
void solve(int n){
int a[4] = {0};
for(int i=0;i<4;i++){
a[i] = n%10;
n /= 10;
}
sort(a,a+4,cmp); //从大到小排序
int n1 = 0, n2 = 0;
for(int i=0;i<4;i++){
n1 = n1*10 + a[i]; //最大值
n2 = n2*10 + a[3-i]; //最小值
}
n = n1 - n2;
printf("%04d - %04d = %04d",n1,n2,n1-n2);
if(n1-n2!=0&&n1-n2!=6174) printf("\n");
if(n1-n2==0||n1-n2==6174) return; //结束递归的条件
solve(n1-n2);
}
int main(){
int n;
scanf("%d",&n);
solve(n);
return 0;
}