UVA SOLUTION : 263-Number Chains

#include <iostream>
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<math.h>
#include<map>
#include<algorithm>
#define READ freopen("in.txt","r",stdin);
#define WRITE freopen ("output.txt","w",stdout);

using namespace std;

int main()
{
   // READ WRITE
    map<int,int>mep;
    int n;
    while(~scanf("%d",&n))
    {
        if(n==0) break;
        char ss[50];
        char des[50];
        int cnt=0;
        printf("Original number was %d\n",n);
        while(1)
        {
            if(n==0) break;
            sprintf(ss,"%d",n);
            int l=log10(n)+1;
            sort(ss,ss+l);
            int j=0;
            for(int i=l-1; i>=0; i--) des[j++]=ss[i];
            des[j]='\0';
            int x=atoi(ss);
            int y=atoi(des);
            int res;
            res=y-x;
            printf("%d - %d = %d\n",y,x,res);
            if(mep[res]==1)
            {
                cnt++;
                break;
            }
            else
            {
                mep[res]++;
                cnt++;
                n=res;
            }
        }
        if(n==0)
        {
            printf("0 - 0 = 0\n");
            cnt++;
        }
        printf("Chain length %d\n",cnt);
        printf("\n");
        mep.clear();

    }

    return 0;
}