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

327人阅读 评论(0)

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

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;
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：13268次
• 积分：375
• 等级：
• 排名：千里之外
• 原创：24篇
• 转载：1篇
• 译文：0篇
• 评论：11条
文章分类
阅读排行
最新评论