- Have Fun with Numbers (20)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 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
#include<cstdio>
char s[22];
int a[22]={0};
int b[22]={0};
int count[10]={0};
void getarray(char s[],int &n){
int i=0;
while(s[i]!='\0'){
a[i+1]=s[i]-'0';
i++;
}
n=i;
}
int main(){
int n;
scanf("%s",s);
getarray(s,n);
int c=0;
for(int i=1;i<=n;i++){
count[a[i]]++;
}
for(int i=n;i>=1;i--){
b[i]=(a[i]*2+c)%10;
c=(a[i]*2+c)/10;
}
b[0]=c;
if(c==1){
printf("No\n");
for(int i=0;i<=n;i++){
printf("%d",b[i]);
}
}else{
for(int i=1;i<=n;i++){
count[b[i]]--;
}
int flag=0;
for(int i=0;i<=9;i++){
if(count[i]!=0){
printf("No\n");
flag=1;
break;
}
}
if(flag==0)printf("Yes\n");
for(int i=1;i<=n;i++){
printf("%d",b[i]);
}
}
return 0;
}