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

注意每个数字的个数也要一样，比如1123456789 输出No

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

using namespace std; 
void Output(int n,char Number[]);
 
int main()
{
	char number1[30],number2[30],number[30];
	gets(number1); 
	int n,i;
	n=strlen(number1);
	int m,j,x;
	j=x=0; 
	for(i=n-1;i>=0;i--)
	{
		m=(number1[i]-48)*2+x; 
		x=m/10;
		number2[j]=m%10+48;
		number[j]=m%10+48; 
		j++; 
	}
	if(x>0)
	{
		number2[j]=x+48;
		number[j]=x+48;
		j++; 
	}
	sort(number1,number1+n);
	sort(number2,number2+j); 
	if(j!=n)
	{
		printf("No\n");
		Output(j,number); 
	} 
	else
	{
		for(i=0;i<n;i++)
		{
			if(number1[i]!=number2[i])
			{
			     printf("No\n");
		         Output(j,number);
				 break; 
			} 
		}
		if(i>=n)
		{		
		    printf("Yes\n");
		    Output(j,number); 
		} 
	} 
	return 0; 
}

void Output(int n,char Number[])
{
    int i;
	for(i=n-1;i>=0;i--)
	{
		printf("%c",Number[i]); 
	} 
	printf("\n");	
}