PAT数据结构陈越——自测04

最近在看网易云课堂的浙大数据结构公开课视频。跟着做了一些基础的习题。这是其中一道。
题目如下：

00-自测4. Have Fun with Numbers (20)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
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 file 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位的数字，乘上2倍，得出的数字是否和原来的数字构成是一样的，比如原来是123456789，乘上2后=246913578还是由123456789这9个数字组成的数，只是顺序变了。如果输入的数字满足上面的要求就输出Yes，否则输出No，并输出x2后的结果。
因为最多有20位的数字，就不能简单用int或long计算，要用字符数组模拟乘法的计算，将输入的数每一位x2+进位得到结果。具体代码如下：

int main() {
    //记录输入正整数的数字组成
    int zc[10] = {0};
    //因为不知道长度所以先读取成字符串
    char input_str[25];
    cin>>input_str;
    //获得字符串长度
    int length = strlen(input_str);
    int num[25];
    int i;
    //字符数组转换成int数组,并赋值记录数组
    for(i=0;i<length;i++) {
        num[i] = input_str[length-i-1]-'0';
        zc[num[i]]++;
    }
    //for(i=0;i<10;i++) cout<<zc[i]<<" "; 
    //把原来的数字x2
    int c = 0;
    for(i=0;i<length;i++) {

        int s = num[i]*2+c;
        num[i] = s%10;
        c = s/10;
    }
    if(c!=0) {
        num[length]=c;
        length++;
    }
    for(i=0;i<length;i++) {
       zc[num[i]]--;
    }
    bool isOk=true;
    for(i=0;i<10;i++) {
        if(!zc[i]==0) isOk=false;
    }
    for(i=length-1;i>=0;i--) cout<<num[i];
    cout<<endl;
    if(isOk) cout<<"YES";
    else cout<<"NO";
    cout<<endl;
    return 0;
}