Uva OJ 263 Number Chains

最新推荐文章于 2014-11-14 12:12:58 发布

insaneguy

最新推荐文章于 2014-11-14 12:12:58 发布

阅读量765

点赞数

分类专栏： UVA_OJ 文章标签： AOAPC_1 水题

本文链接：https://blog.csdn.net/insaneguy/article/details/28427497

版权

UVA_OJ 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Number Chains

Given a number, we can form a number chain by

arranging its digits in descending order
arranging its digits in ascending order
subtracting the number obtained in (2) from the number obtained (1) to form a new number
and repeat these steps unless the new number has already appeared in the chain

Note that 0 is a permitted digit. The number of distinct numbers in the chain is the length of the chain. You are to write a program that reads numbers and outputs the number chain and the length of that chain for each number read.

Input and Output

The input consists of a sequence of positive numbers, all less than , each on its own line, terminated by 0. The input file contains at most 5000 numbers.

The output consists of the number chains generated by the input numbers, followed by their lengths exactly in the format indicated below. After each number chain and chain length, including the last one, there should be a blank line. No chain will contain more than 1000 distinct numbers.

Sample Input

Sample Output

Original number was 123456789
987654321 - 123456789 = 864197532
987654321 - 123456789 = 864197532
Chain length 2

Original number was 1234
4321 - 1234 = 3087
8730 - 378 = 8352
8532 - 2358 = 6174
7641 - 1467 = 6174
Chain length 4

Original number was 444
444 - 444 = 0
0 - 0 = 0
Chain length 2

#include <cstdio>
#include <cstdlib>
#include <cstring>

int get_next(int x)
{
    int a, b, n;
    char s[10];
    sprintf(s, "%d", x);
    n = strlen(s);
    for (int i = 0; i < n; ++i)
    {
        for (int j = i+1; j < n; ++j)
        {
            if (s[i] > s[j])
            {
                char t = s[i];
                s[i] = s[j];
                s[j] = t;
            }
        }
    }
    sscanf(s, "%d", &b);
    for (int i = 0; i < n/2; ++i)
    {
        char t = s[i];
        s[i] = s[n-1-i];
        s[n-1-i] = t;
    }
    sscanf(s, "%d", &a);
    printf("%d - %d = %d\n", a, b, a - b);
    return a - b;
}

int num[2000], count;
int main()
{
    while (scanf("%d", &num[0]) == 1 && num[0] != 0)
    {
        printf("Original number was %d\n", num[0]);
        count = 1;
        for (;;)
        {
            num[count] = get_next(num[count-1]);
            int found = 0;
            for (int i = 0; i < count; ++i)
            {
                if (num[count] == num[i])
                {
                    found = 1;
                    break;
                }
            }
            if (found)
                break;
            ++count;
        }
        printf("Chain length %d\n\n", count);
    }
    return 0;
}