PAT 甲级 1023 Have Fun with Numbers

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

题意：将old number乘以2之后获得的新number中的数字组成及其个数和old number一致，但是不同的排列。

思路：
1.将old number和new number都存储在字符串中，方便调用length（）函数进行位数比较;
2.采用两个int数组来存储old number和new number中每个数字出现的次数，数组下标0到9代表出现的数字；
3.审题清楚，输出格式规范，Yes和No输出之后还要输出一次new number（我一开始就是没注意到这个细节所以有三个测试点过不了);
4.不要忘记处理最后的进位，比如最高位是9，那么最后的进位还有一个1;

#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<iostream>
using namespace std;
int res1[11],res