PAT (Advanced Level) Practice A1023 Have Fun with Numbers （20 分）(C++)（甲级）（大数乘法）

原题链接：1023 Have Fun with Numbers

using namespace std;
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include <ctime>
#include <cmath>

typedef struct bign
{
    int d[30];
    int len;
}bign;
bign O = {0}, D = {0};//O为原始数据，D为其二倍

int P[10] = {0};//P标志O和D是否由相同的元素组成

int main()
{
    char S[30];
    int carry = 0, flag = 0;//carry进位位
    scanf("%s", S);
    O.len = strlen(S);//把数据由高存储在高位的顺序存储在O中
    for(int i=0; i<O.len; i++) O.d[i] = S[O.len-1-i] - '0';
    for(int i=0; i<O.len; i++)
    {
        P[O.d[i]]++;//
        D.d[D.len++] = (O.d[i]*2 + carry)%10;
        if((O.d[i]*2 + carry)/10) carry = 1;
        else carry = 0;
        P[D.d[D.len-1]]--;
    }
    if(carry) D.d[D.len++] = 1;
    for(int i=0; i<10; i++)
    {
        if(P[i])//该数字出现次数不一致
        {
            flag = 1;
            break;
        }
    }
    if(flag) printf("No\n");
    else printf("Yes\n");
    while(D.len) printf("%d", D.d[--D.len]);
	return 0;
}