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

大数乘法，如果输入有20位，longlong 也存不了两倍，所以用string存储模拟乘法。

#include<bits/stdc++.h>

using namespace std;
int ans[10] = {0};
int bns[10] = {0};
stack<int> s;

int main() {
    string t;
    cin >> t;
    string dt;
    int tag = 0;//进位
    for (auto it = t.rbegin(); it != t.rend(); it++) {
        ans[*it - '0']++;
        //模拟乘法
        if (!tag) {
            int t = 2 * (*it - '0');
            tag = t / 10;
            s.push(t % 10);
        } else {
            int t = 2 * (*it - '0') + tag;
            tag = t / 10;
            s.push(t % 10);
        }
    }
    if (tag)s.push(tag);
    int temp[30];
    int cnt = 0;
    while (!s.empty()) {
        int t = temp[cnt++] = s.top();
        bns[t]++;
        s.pop();
    }

    int f = 1;
    for (int i = 0; i < 10; i++) {
        if (ans[i] != bns[i])
            f = 0;
    }
    if (f)cout << "Yes" << endl;
    else cout << "No" << endl;
    for (int i = 0; i < cnt; i++)
        cout << temp[i];
}