PAT 甲级 1023. Have Fun with Numbers（大数的两倍运算）

原题传送门

• 题意：给出一个长度不超过20的整数，问这个整数两倍后的数位是否为原数位的一个排列。再输出两倍后的结果。

#include <iostream>
#include <string.h>
using namespace std;

int book[10] = {0}; // 判定关键，若两倍后的数位为原数位的一个排列，则++ --后book[10]依然全是0

int main(int argc, const char * argv[]) {
    char num[22];
    cin >> num;
    int flag = 0;
    int len = strlen(num);
    for(int i = len-1; i >= 0; --i) {
        int temp = num[i] - '0';
        book[temp]++;
        temp = temp * 2 + flag;
        flag = 0;
        if(temp >= 10) {
            temp = temp - 10;
            flag = 1;
        }
        num[i] = (temp + '0');
        book[temp]--;
    }

    int flag1 = 0;
    for(int i = 0; i < 10; ++i) {
        if(book[i] != 0)
            flag1 = 1;
    }

    if(flag == 1 || flag1 == 1)
        cout << "No" << endl;
    else
        cout << "Yes" << endl;

    if(flag == 1)
        cout << "1";
    for(int i = 0; i < len; ++i)
        cout << num[i];
    cout << endl;

    return 0;
}

附原题：

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 file 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