PAT 甲级 1023 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.

输入

Each input contains one test case. Each case contains one positive integer with no more than 20 digits.

输出

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.

思路

其实就是一个很大的数可以看做一个字符串，它2之后所包含的字符和原来一样即可。
这样其实就是我们手动2也就是自己+自己即可。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<string.h>
using namespace std;
int pan[10] = { 0 };
int pan2[10] = { 0 };
int main()
{
	char num[25] = { 0 };
	cin.getline(num, 25);
	for (int i = 0; num[i] != 0; i++)
	{
		pan[num[i] - 48] ++;
	}
	int num_rev[25] = { 0 };
	int len = strlen(num);
	for (int i = 0; i < strlen(num); i++)
	{
		num_rev[i] = num[strlen(num) - 1 - i]-48;
	}
	int d_num[30] = { 0 };
	for (int i = 0; i < len; i++)
	{
		d_num[i] += (num_rev[i] * 2) % 10;
		d_num[i+1] += (num_rev[i] * 2) / 10;
	}
	int d_len = 0;
	if (d_num[len] == 0)
	{
		d_len = len;
	}
	else
	{
		d_len = len + 1;
	}
	int flag = 1;
	for (int i = 0; i < d_len; i++)
	{
		pan2[d_num[i]]++;
	}
	for (int i = 0; i <= 9; i++)
	{
		if (pan2[i] != pan[i])
		{
			flag = 0;
			break;
		}
	}
	if (flag == 1)
	{
		printf("Yes\n");
	}
	else
	{
		printf("No\n");
	}
	for (int i = d_len - 1; i >= 0; i--)
	{
		printf("%d", d_num[i]);
	}
	printf("\n");
}