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

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

int main(){
    string a,b;
    cin>>a;
    int flag=0,temp;
    for(int i=a.length()-1;i>=0;i--){
        temp=flag+(a[i]-'0')*2;
        flag=temp>9?1:0;
        b.push_back(temp%10+'0');
    }
    if(flag==1)
        b.push_back('1');
    reverse(b.begin(),b.end());
    string c=b;
    if(a.length()!=b.length()){
        cout<<"No"<<endl;
        cout<<c;
        return 0;
    }else{
        sort(a.begin(),a.end());
        sort(b.begin(),b.end());
        for(int i=0;i<a.length();i++){
            if(a[i]!=b[i]){
                cout<<"No"<<endl;
                cout<<c;
                return 0;
            }
        }
    }
    cout<<"Yes"<<endl;
    cout<<c;
    return 0;
}