PAT(甲级)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<algorithm>
#include<string>
using namespace std;
int main()
{
    string a;
    cin >> a;
    int l = a.length();
    int flag = 0;
    
    string b = "";
    for (int i = l - 1; i >= 0;i--)
    {
        int q = a[i] - '0';
        q = 2 * q + flag;
        if(q>=10)
        {
            flag = 1;
            q = q % 10;
        }else{
            flag = 0;
        }
        b = to_string(q) + b;
    }
    if(flag == 1)
    {
        b = "1" + b;
        cout << "No" << '\n';
         cout << b;
        return 0;
    }
    string c = a;
    string d = b;
    sort(c.begin(),c.end());
    sort(d.begin(), d.end());
    if(d != c)
        cout << "No" << '\n';
    else
        cout << "Yes" << '\n';
    cout << b;
    return 0;
}