Have Fun with Numbers

自测-4 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

---

思路：
1，通过提交答案可以看出出题者在进行数字计算时使用的方法是用unsigned long 定义过长的数字串，但本题也完全可以用打数相加的方法处理数字。
2，使用数组b[10],记忆计算后的数所出现的数字，再与输入时的数进行比较，即可得解。

---

代码：

#include<stdio.h>
#include<string.h> 

int main(){
	char sum[30];
	gets(sum);
	int sun[30],n,t,m;
	n=strlen(sum);
	m=n;
	t=0;
	for(int i=0;i<n;i++){
		sun[n-1-i]=sum[i]-'0';
		//这里将数组倒置，即sun为后续中的输入数字串
		//(char-'0'==int) 
	}
	for(int i=0;i<n;i++){
		sum[i]=(sun[i]*2+t)%10+'0';
		t=(sun[i]*2+t)/10;
		if(t&&i==n-1){
			sum[n]=1+'0';
			//sum为输出串 
			n++;
		}
	}
	t=1;
	//这里将t用作判断数字重复的变量 
	int b[10];
	for(int i=0;i<10;i++){
		b[i]=0;
	}
	for(int i=0;i<m;i++){
		b[sum[i]-'0']=1;
	}
	for(int i=0;i<n;i++){
		if(b[sun[i]]!=1){
			t=0;
			break;
		}
	}
	
	if(t){
		printf("Yes\n");
	}
	else{
		printf("No\n");
	}
		for(int i=n-1;i>=0;i--){
		printf("%c",sum[i]);
	}
} 

---

总结：
1，char型可以通过-‘0’,当作int进行使用；
2，一定要搞清楚自己各个变量代表的“物”，，，，