PAT甲级——Palindromic Number

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

Non-palindromic numbers can be paired with palindromic ones via a series of operations. First, the non-palindromic number is reversed and the result is added to the original number. If the result is not a palindromic number, this is repeated until it gives a palindromic number. For example, if we start from 67, we can obtain a palindromic number in 2 steps: 67 + 76 = 143, and 143 + 341 = 484.

Given any positive integer N, you are supposed to find its paired palindromic number and the number of steps taken to find it.

Input Specification:

Each input file contains one test case. Each case consists of two positive numbers N and K, where N (≤10​10​​) is the initial numer and K (≤100) is the maximum number of steps. The numbers are separated by a space.

Output Specification:

For each test case, output two numbers, one in each line. The first number is the paired palindromic number of N, and the second number is the number of steps taken to find the palindromic number. If the palindromic number is not found after K steps, just output the number obtained at the Kth step and K instead.

Sample Input 1:

67 3

Sample Output 1:

484
2

Sample Input 2:

69 3

Sample Output 2:

1353
3

思路：这道题还是考的大整数相加问题，按照通用模板写出大整数相加的相关函数，再写出判断大整数是否为回文数的判断函数。在计算次数少于最大次数同时结果不为回文数的时候反复进行相加计算，直到次数达到最大值或者结果出现回文数。

代码：

#include <iostream>
#include<cstring>
#include<algorithm>
using namespace std;

struct bign
{
	int d[1000];
	int len;
	bign() {
		memset(d, 0, sizeof(d));
		len = 0;
	}
};

bign change(char str[])
{
	bign a;
    a.len = strlen(str);
	for (int i = 0; i < a.len; i++)
	{
		a.d[i] = str[a.len - i - 1] - '0';
	}
	return a;
}

bign add(bign a, bign b)
{
	bign c;
	int temp = 0, carry = 0;
	for (int i = 0; i < a.len || i < b.len; i++)
	{
		temp = a.d[i] + b.d[i] + carry;
		c.d[c.len++] = temp % 10;
		carry = temp / 10;
	}
	if (carry != 0)
	{
		c.d[c.len++] = carry;
	}
	return c;
}

void print(bign a)
{
	for (int i = a.len - 1; i >= 0; i--)
	{
		printf("%d", a.d[i]);
	}
}

bool Judge(bign a)
{
	for (int i = 0; i < a.len / 2; i++)
	{
		if (a.d[i] != a.d[a.len - i - 1]) return false;
	}
	return true;
}

int main()
{
	char str[1000]; int k=0,T;
	scanf("%s%d", str, &T);
	bign a= change(str);
	while (k<T&&Judge(a)==false)
	{
		bign b = a;
		reverse(b.d, b.d + b.len);
		a = add(a, b);
		k++;
	}
	print(a);
	printf("\n%d", k);
	return 0;
	

}

复习：

       这道题还是大数的计算问题，只不过多了一个回文的判定。首先要想到建立结构体来存储输入的字符数组为整型数组，以及数组的长度，然后分别定义相加、输出、判断回文等函数来处理各个小问题，这道题是这一类型题通用的模板，要好好领会。

二刷代码：

#include <iostream>
#include<cstring>
#include<algorithm>
using namespace std;

struct bign
{
	int d[1000];
	int len;
	bign()
	{
		memset(d, 0, sizeof(d));
		len = 0;  
	}
};

bool Judge(bign a)
{
	for (int i = 0; i <= a.len/2; i++)
	{
		if (a.d[i] != a.d[a.len - i - 1])
		{
			return false;
		}
	}
	return true;
}

bign Change(char str[])
{
	bign a;
	a.len = strlen(str);
	for (int i = 0; i < a.len; i++)
	{
		a.d[i] = str[a.len - i - 1] - '0';

	}
	return a;
}





bign add(bign a, bign b)
{
	bign c;
	int carry = 0;
	for (int i = 0; i < a.len||i<b.len; i++)
	{
		int temp = a.d[i] + b.d[i] + carry;
		c.d[c.len++] = temp % 10;
		carry = temp / 10;
	}
	if (carry != 0)
	{
		c.d[c.len++] = carry;
	}
	return c;
}


void print(bign a)
{
	for (int i = a.len - 1; i >= 0; i--)
	{
		printf("%d", a.d[i]);
	}
	printf("\n");
}



int main()
{
	char a[1000];
	int k,times=0;
	scanf("%s %d", a, &k);
	bign num1;
	num1 = Change(a);
	while (Judge(num1)==false && times<k)
	{
		bign num2 = num1;
		reverse(num2.d, num2.d + num2.len);
		num1 = add(num1, num2);
		times++;
	}
	print(num1);
	printf("%d\n", k);
	return 0;
	


}