萌新刚学OI，求助，最后一个点WA了

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;

int num[30];
ll t[300],r[300],len;

ll getmin(ll n){
	ll res = 0;
	for(int i=1;i<=29;++i) num[i] = 0;
	int j = 1;
	while(n){
    	num[j] = n%10;
    	n /= 10;
    	++j;
	}
	sort(num+1,num+j);
	for(int i=1;i<j;++i)
    	res = res*10 + num[i];
	return res;
}//算出最大的排列

ll getmax(ll n){
	ll res = 0;
	for(int i=1;i<=29;++i) num[i] = 0;
	int j = 1;
	while(n){
    	num[j] = n%10;
    	n /= 10;
    	++j;
	}
	sort(num+1,num+j);
	for(int i=j-1;i>=1;--i)
    	res = res*10 + num[i];
	return res;
}//算出最小的排列

void find(){
	int i,j;
	len = 1;
	ll st;
	for(;;++len){
    	i = 1;
    	j = 2;
    	while(t[i] != t[i+len]){
        	if(i+len>100) break;
        	++i;
    	}
    	if(t[i]!=t[i+len]||t[i]!=t[i+2*len]) continue;
    	st = t[i];
    	r[1] = st;
    	++i;
    	for(;;++i){
        	if(t[i]==st) break;
        	r[j] = t[i];
        	++j;
    	}
    	break;
	}
}//寻找循环节

int main(){
	ll n;
	while(cin>>n){
    	for(int i=1;i<=100;++i){
        	n = getmax(n)-getmin(n);
        	t[i] = n;
        	r[i] = 0;
    	}
    	find();
    	for(int i=1;i<=len;++i)
        	printf("%lld ",r[i]);
    	printf("\n");
	}
	return 0;
}