1023

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.h>

using namespace std;

int main()
{
    char num[21];
    scanf("%s", num);
    int len = strlen(num);
    int isdou = 1;
    int plus1 = 0;
    int t[10]={0};
    int temp;
    for(int i=len-1;i>=0;i--)
    {
        temp = num[i]-'0';
        t[temp]++;
        if(temp >= 5)
        {
            t[temp*2-10+plus1]--;
            num[i] = temp*2-10+plus1 + '0';
            plus1 = 1;
        }
        else
        {
            t[temp*2+plus1]--;
            num[i] = temp*2+plus1 + '0';
            plus1 = 0;
        }
    }
    for(int i=0;i<10;i++)
    {
        if(t[i] != 0)
            isdou = 0;
    }

    if(isdou == 1)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    if(plus1 == 1)
        cout << "1";
    printf("%s", num);
    return 0;
}