自测-4 Have Fun with Numbers (20 分)

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a different permutation. Check to see the result if we double it again!

Now you are suppose to check if there are more numbers with this property. That is, double a given number with k digits, you are to tell if the resulting number consists of only a permutation of the digits in the original number.

Input Specification:
Each input contains one test case. Each case contains one positive integer with no more than 20 digits.

Output Specification:
For each test case, first print in a line “Yes” if doubling the input number gives a number that consists of only a permutation of the digits in the original number, or “No” if not. Then in the next line, print the doubled number.

Sample Input:

1234567899

Sample Output:

Yes
2469135798

挺难的，我感觉。要我说这题像我也只有上网找找思路先，谁能想到最后2个测试点超过long long了呢，所以只能用字符串了（想当初我一把心酸泪洒在了整形数据上，却发现根本不够塞牙缝…）。

进位的做法和我以前做的时间表示题类似。

上代码：

#include <stdio.h>
#include <string.h>
int main()
{/*特别注意这三个数组一定一定一定要初始化！！！要不然会产生输出随机数
要是问我是怎么发现的（每个数组我一个一个循环输出，看出来的...）*/
    int a[50] = {0}, a1[50] = {0}, b[50] = {0}, i, t, flag = 1,   tag = 0;
    char s[50];
    scanf("%s", s);

    for (i = 0; s[i] != '\0'; i++)
    {
        t = s[i] - '0';
        b[i] = t * 2;
        a[t]++;
    }
    for (i = strlen(s) - 1; i >= 0; i--)
    {
        if (b[i] > 9 && i > 0)
        {
            b[i] -= 10;
            b[i - 1]++;
        }
        if (b[0] > 9)
        {
            tag = 1;/*如果第一个数b[0]大于9，那么后面计数的时候需要特殊处理下哦*/
        }
    }
    if (tag)
    {
        for (i = 1; i < strlen(s); i++)
        {
            a1[b[i]]++;
        }
        t = b[0];
        a1[t % 10]++;
        t /= 10;
        a1[t % 10]++;
    }
    else
    {
        for (i = 0; i < strlen(s); i++)
        {
            a1[b[i]]++;
        }
    }/* if-else 计数模块哦*/

    for (i = 0; i <= 9; i++)
    {
        if (a[i] != a1[i])
        {
            flag = 0;
            break;
        }
    }/*判断模块哦*/
    if (flag)
    {
        printf("Yes\n");
        for (i = 0; i < strlen(s); i++)
        {
            printf("%d", b[i]);
        }
    }
    else
    {
        printf("No\n");
        for (i = 0; i < strlen(s); i++)
        {
            printf("%d", b[i]);
        }
    }
    return 0;
}