1023 Have Fun with Numbers (20 分)

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结尾无空行

Code:

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int book[10] = {0};
    char ch[22];
    bool flag = true;
    int carry = 0;
    scanf("%s", ch);
    int len = strlen(ch);
    for (int i = len - 1; i >= 0; i--)
    {
        int temp = ch[i] - '0';
        book[temp]++;
        temp = temp * 2 + carry;
        carry = 0;
        if (temp >= 10)
        {
            carry = 1;
            temp -= 10;
        }
        ch[i] = temp + '0';
        book[temp]--;
    }
    for (int i = 0; i < 10; i++)
    {
        if (book[i])
            flag = false;
    }
    if (flag && carry == 0)
        cout << "Yes" << endl;
    else
    {
        cout << "No" << endl;
        if(carry==1)
        printf("1");
    }
    printf("%s", ch);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int book[10] = {0};
int main()
{
    string str;
    bool flag = true;
    int carry = 0;
    cin >> str;
    int len = str.length();
    for (int i = len - 1; i >= 0; i--)
    {
        int temp = str[i] - '0';
        book[temp]++;
        temp = temp * 2 + carry;
        carry = 0;
        if (temp >= 10)
        {
            carry = 1;
            temp -= 10;
        }
        str[i] = temp + '0';
        book[temp]--;
    }
    if (carry == 1)
        str.insert(0, "1");
    for (int i = 0; i < 10; i++)
    {
        if (book[i])
            flag = false;
    }
    //carry == 0可以省略 多了一位 flag 必定为false 
    if (flag && carry == 0)
        cout << "Yes" << endl;
    else
    {
        cout << "No" << endl;
    }
    cout << str;
    return 0;
}