00-自测4. Have Fun with Numbers

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

#include<iostream>
#include<string>
using namespace std;
int main() {
    int i = ;
    int j = ;
    int len;
    int temp;
    string num;
    //判断是否为输入的副本
    bool is_dup = true;
    int judge[];
    //保存输出结果
    int result[];
    //保存进位
    int counter[];

    cin >> num;
    len = num.length();

    for (i = ; i < ; i++) {
        counter[i] = ;
        judge[i] = ;
    }
    //计算输出结果
    for (i = len - ; i >= ; i--) {
        temp = (num[i] - '');
        judge[temp]++;
        temp = temp *  + counter[i];
        result[j++] = temp % ;
        if (i != )
            counter[i - ] = temp / ;
        else {
            result[j++] = temp / ;
        }
    }
    if (result[j - ] != )
        len = j;

    for (i = ; i < len; i++) {
        judge[result[i]]--;
    }

    for (i = ; i < ; i++) {
        if (judge[i] != ) {
            is_dup = false;
        }
    }

    if (is_dup)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;

    for (j = len - ; j >= ; j--) {
        cout << result[j];
    }
    return ;
}