HDU1282+水题+模拟

/*
模拟+回文数
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<map>
#include<math.h>
typedef long long ll;
//typedef __int64 int64;
const int maxn = 105;
const int maxm = 1005;
const int inf = 0x7FFFFFFF;
const double pi = acos(-1.0);
const double eps = 1e-8;
using namespace std;
int a[ maxn ];

int judge( int n ){
    int pren = n;
    int newn[ 105 ];
    int len = 0;
    while( n!=0 ){
        newn[ len++ ] = n%10;
        n/=10;
    }
    int nown = newn[0];
    for( int i=1;i<len;i++ ){
        nown*=10;
        nown += newn[i];
    }
    //printf("nown:%d\n",nown);
    if( pren==nown ) return -1;//正序和倒序是相同的
    else return (pren+nown);
}
        
int main(){
    int n;
    while( scanf("%d",&n)!=EOF ){
        int cnt = 0;
        if( judge(n)==-1 ){
            printf("0\n");
            printf("%d\n",n);
            continue;
        }
        a[ cnt++ ] = n;
        while( 1 ){
            a[ cnt++ ] = judge( n );
            n = a[ cnt-1 ];
            if( judge(n)==-1 ){
                //a[ cnt++ ] = n;
                break;
            }
        }
        
        printf("%d\n",cnt-1);
        for( int i=0;i<cnt;i++ ){
            if( i==0 ) printf("%d",a[0]);
            else printf("--->%d",a[ i ]);
        }
        printf("\n");
    }
    return 0;
}