7-49 Have Fun with Numbers (20分) C语言 带注释

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

 

作者

陈越

单位

浙江大学

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

---

编译器 (1)

C (gcc)

#include <stdio.h>
#define n 21 
int main(int argc, char *argv[])
{
	char a[n],ch;
	int i,len_a,b[n]={0},j,temp,flag=1;
	
	ch=getchar();		//输入a[n]，并求len_a。不包含'\n'。 
	for(i=0;ch!='\n';i++){
		a[i]=ch;
		ch=getchar();
	}
	len_a=i;
//	printf("len_a=%d %s#",len_a,a);		//len_a=10 1234567899#
	
	for(i=0;i<len_a;i++){		//构建b[len_a+1]，使b=a*2。 
		b[i]+=(a[i]-'0')*2/10;
		b[i+1]+=(a[i]-'0')*2%10;
	}
	
	if(b[0]!=0){
		printf("No\n");
		for(i=0;i<len_a+1;i++)
			printf("%d",b[i]);
		return 0;
	}
	
	int *p=&b[1],c[len_a];
	for(i=0;i<len_a;i++)
		c[i]=p[i];
	
	for(i=0;i<len_a;i++){
		for(j=i+1;j<len_a;j++){
			if(p[i]<p[j]){
				temp=p[i];
				p[i]=p[j];
				p[j]=temp;
			}
			if(a[i]<a[j]){
				ch=a[i];
				a[i]=a[j];
				a[j]=ch;
			}
		}
		if(p[i]!=a[i]-'0'){
			flag=0;
			break;
		}
	}
	
	if(flag==1){
		printf("Yes\n");
	}else{
		printf("No\n");
	}
	for(i=0;i<len_a;i++){
		printf("%d",c[i]);
	}
	
	return 0;
}