#include<bits/stdc++.h>
using namespace std;

bool cmp(int a,int b){
	return a>=b;
}
int s[10];
int da(int n){
	s[1]=n%10;
    s[2]=n/10%10;
    s[3]=n/100%10;
    s[4]=n/1000;
    sort(s+1,s+5,cmp);
    int x = s[1]*1000+s[2]*100+s[3]*100+s[4];
    return x;
}

int xiao(int n){
	s[1]=n%10;
    s[2]=n/10%10;
    s[3]=n/100%10;
    s[4]=n/1000;
    sort(s+1,s+5);
    int x = s[1]*1000+s[2]*100+s[3]*100+s[4];
    return x;
}

int main(){
	int n;
	cin>>n;
//	cout<<s[1]<<" "<<s[2]<<" "<<s[3]<<" "<<s[4];
	while(1){
		int nn = da(n) - xiao(n);
		if(nn==6174){
			cout<<da(n)<<" - "<<xiao(n)<<" = "<<nn<<endl;
			break;
		}else if(nn==0){
			cout<<da(n)<<" - "<<xiao(n)<<" = 0000"<<endl;
			break;
		}else{
			cout<<da(n)<<" - "<<xiao(n)<<" = "<<nn<<endl;
			n = nn;
		}
	}
	return 0;
}

0 条评论

目前还没有评论...

信息

ID
1
时间
1000ms
内存
256MiB
难度
3
标签
递交数
64
已通过
33
上传者