PAT 1023 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

题意：
1、大整数运算

2、duplication 重复 ；permutation 排列，组合；

我的代码：

#include<cstdio>
#include<cstring>
int hashtable[10] = {0},hashtemp[10] = {0};
char result[25],num[25];
int doubleit(char num[],int len)
{
    int temp = 0,cnt = 0;
    for (int i = len - 1 ;i >= 0 ;i--)
    {
        result[cnt++] = ((num[i] - '0') * 2 + temp) % 10 + '0';
        hashtemp[((num[i] - '0') * 2 + temp) % 10]++;
        temp = ((num[i] - '0') * 2 + temp) / 10;
    }
    if (temp != 0)
    {
        result[cnt++] = '1';
        hashtemp[1]++;
    }
    return cnt;
}
bool judge(int len,int len1)
{
    if (len1 != len)
        return false;
    else
    {
        for (int i  = 0 ;i < 10 ;i++)
        {
            if (hashtable[i] != hashtemp[i])
                return false;           
        }              
    }
    return true;    
}
int main()
{
    scanf("%s",num);
    int len = strlen(num);
    for (int i = 0 ;i < len ;i++)
        hashtable[num[i] - '0']++;
    int len1 = doubleit(num,len);
    if (judge(len,len1))
        printf("Yes\n");
    else
        printf("No\n");
    for (int i = len1 - 1 ; i >= 0 ;i--)
        printf("%c",result[i]);
    return 0;
}