PTA 自测-4 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 <string>
using namespace std;
int main()
{
    string a;
    int b[20],t,rem = 0,index[10]={0};
    cin>>a;
    t = a.length() - 1;
    for (int i = a.length() - 1; i >= 0; i--,t--)
    {   
        index[a[i] - '0']++;
        int n = ((a[i] - '0') * 2 + rem);
        b[t] = n % 10;
        rem = n / 10;
        index[b[t]]--;
    }
       if(rem == 1)
            {
                cout<<"No"<<endl;
            }
        else
        {
             t = 0;
            for (int i = 0; i < 10; i++)
                {
                if(index[i] != 0)
                    t = -1;
                }
                if(t != 0)
                        cout<<"No"<<endl;
                else
                        cout<<"Yes"<<endl;
        }
    for (int i = 0; i < a.length(); i++)
    {   
        if(i==0&&rem!=0)
            cout<<rem;
        cout<<b[i];
    }
    return 0;
}