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 <vector>
#include <algorithm>

using namespace std;

vector<int> add(vector<int> &a) {
    vector<int> c;
    int t = 0;
    for (int i = 0; i < a.size(); ++i) {
        c.push_back((a[i] * 2 + t) % 10);
        t = a[i] * 2 / 10;
    }
    if (t)
        c.push_back(t);
    return c;
}

int main() {
    vector<int> a, b, c;
    string s;
    cin >> s;
    for (int i = s.size() - 1; i >= 0; --i) {
        a.push_back(s[i] - '0');
    }
    b = add(a);
    c = b;
    sort(b.begin(), b.end());
    sort(a.begin(), a.end());
    if (a == b)
        puts("Yes");
    else
        puts("No");
    for (int i = c.size() - 1; i >= 0; --i) {
        cout << c[i];
    }
    cout << endl;
    return 0;
}