【笨方法学PAT】1136 A Delayed Palindrome （20 分）

一、题目

Consider a positive integer N written in standard notation with k+1 digits a​i​​ as a​k​​⋯a​1​​a​0​​ with 0≤a​i​​<10 for all i and a​k​​>0. Then N is palindromic if and only if a​i​​=a​k−i​​ for all i. Zero is written 0 and is also palindromic by definition.

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. Such number is called a delayed palindrome. (Quoted from https://en.wikipedia.org/wiki/Palindromic_number )

Given any positive integer, you are supposed to find its paired palindromic number.

Input Specification:

Each input file contains one test case which gives a positive integer no more than 1000 digits.

Output Specification:

For each test case, print line by line the process of finding the palindromic number. The format of each line is the following:

A + B = C

where A is the original number, B is the reversed A, and C is their sum. A starts being the input number, and this process ends until C becomes a palindromic number -- in this case we print in the last line C is a palindromic number.; or if a palindromic number cannot be found in 10 iterations, print Not found in 10 iterations. instead.

Sample Input 1:

97152

Sample Output 1:

97152 + 25179 = 122331
122331 + 133221 = 255552
255552 is a palindromic number.

Sample Input 2:

196

Sample Output 2:

196 + 691 = 887
887 + 788 = 1675
1675 + 5761 = 7436
7436 + 6347 = 13783
13783 + 38731 = 52514
52514 + 41525 = 94039
94039 + 93049 = 187088
187088 + 880781 = 1067869
1067869 + 9687601 = 10755470
10755470 + 07455701 = 18211171
Not found in 10 iterations.

二、题目大意

给一个数字，判断是否是回文；如果不是，这个数字颠倒顺序相加，继续判断；如果重复10次之内还不是回文，直接输出。

三、考点

string

四、注意

1、题目没有说清楚，头一个如果是回文怎么办，这个需要自己判断是否要加上；

2、使用string判断回文比较方便，之后reverse；

3、大数加法，比较常规的操作。

五、代码

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
	//read
	string s,s1,s2;
	cin >> s1;

	s2 = s1;
	reverse(s2.begin(), s2.end());
	if (s1 == s2) {
		cout << s1 << " is a palindromic number.";
		return 0;
	}
	bool flag = false;
	int n = 0;
	while (n < 10 && flag == false) {
		//add
		int jin = 0;
		s = "";
		for (int i = 0; i < s1.length(); ++i) {
			int num = s1[i] + s2[i] - '0' * 2 + jin;
			s += (char)(num % 10 + '0');
			jin = num / 10;
		}
		if(jin!=0)
			s += (char)(jin + '0');
		reverse(s.begin(), s.end());
		cout << s1 << " + " << s2 << " = " << s<<endl;
		s1 = s, s2 = s;
		reverse(s2.begin(), s2.end());
		n++;
		if (s1 == s2) {
			flag = true;
			cout << s1 << " is a palindromic number.";
			break;
		}
	}

	//output
	if (flag == false) {
		cout<<"Not found in 10 iterations.";
	}

	system("pause");
	return 0;
}