#include<iostream>using namespace std;int maxmin(int m){int a,b,c,d,max,min,x,t;a=m/1000;b=m/100%10;c=m/10%10;d=m%10;if(a<b){t=a;a=b;b=t;}if(a<c){t=a;a=c;c=t;}if(a<d){t=a;a=d;d=t;}if(b<c){t=b;b=c;c=t;}if(b<d){t=b;b=d;d=t;}if(c<d){t=c;c=d;d=t;}max=a*1000+b*100+c*10+d;min=d*1000+c*100+b*10+a; x=max-min; return x;}int main(){ int n; cin>>n; while(n--) { int m,count=0,x=0,y=1; cin>>m; while(x!=y) { y=m; x=maxmin(m); m=x; count++;} cout<<count<<endl; } return 0;}//第二种方法，使用sort #include<iostream>#include<algorithm>using namespace std;int main(){int n;cin>>n;while(n--){int m;cin>>m;int k=0,t=1,max,min,count=0;int a[4];while(k!=t){k=m;a[0]=m/1000;a[1]=m/100%10;a[2]=m/10%10;a[3]=m%10;sort(a,a+4);min=a[0]*1000+a[1]*100+a[2]*10+a[3];max=a[3]*1000+a[2]*100+a[1]*10+a[0];t=max-min;m=t;count++;}cout<<count<<endl;}return 0;}
0 0
