浙大PTA 自测-4 Have Fun with Numbers

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

题目大意:输入一串数字并使其翻倍(m=n*2),若m中的各个数字和n中的各个数字
         出现次数相同就输出Yes否则输出No,然后输出m。
解题思路:用c[10]记录原数各数字出现次数，将原数翻倍后将各数字存入b[]，再
         将b[]中出现的数字在对应的c[]中减去，最后若c[]各值均为0，则a[]
         中各数字与b[]中各数字出现次数相同，输出Yes。

代码:

#include<stdio.h>
#include<string.h>
void main()
{
   
    char a[22],b[22];//数字位数要求最大20位只能用char
    int c[10]={
   0},</