1023 Have Fun with Numbers (20point(s))

1023 Have Fun with Numbers (20point(s))

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<bits/stdc++.h>
using namespace std;
int quentity[10]={0};
int main(){
    char ori[22];
    scanf("%s",ori);
    int carry=0;
    int len=strlen(ori);
    for(int i=len-1;i>=0;--i){
        int temp=ori[i]-'0';
        quentity[temp]++;
        temp=temp*2+carry;
        ori[i]=temp%10+'0';
        carry=temp/10;
        quentity[temp%10]--;
    }
    int flag=true;
    for(int i=0;i<10;++i){
        if(quentity[i]!=0){
            flag=false;
            break;
        }
    }
    if(flag&&carry==0) printf("Yes\n");
    else printf("No\n");
    if(carry!=0) printf("1");
    printf("%s",ori);
}