一、题目
输入格式:
输入在一行中给出一个不超过1000位的正整数。
输出格式:
对给定的整数,一行一行输出其变出回文数的过程。每行格式如下
A + B = C
其中A是原始的数字,B是A的逆转数,C是它们的和。A从输入的整数开始。重复操作直到C在10步以内变成回文数,这时在一行中输出“C is a palindromic number.”;或者如果10步都没能得到回文数,最后就在一行中输出“Not found in 10 iterations.”。
输入样例 1:
97152
输出样例 1:
97152 + 25179 = 122331
122331 + 133221 = 255552
255552 is a palindromic number.
输入样例 2:
196
输出样例 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.
二、个人理解
Tips:
- 采用C++的reverse()能很好的帮助此题的编写
- 字符串的模拟加
- 一定要注意,其本身是回文串这一特殊情况
C++:
#include <iostream>
#include <algorithm>
using namespace std;
//判断是否是回文串
bool is_palindromic(string s)
{
string r = s;
reverse(r.begin(), r.end());
for (int i = 0; i < s.length(); i++) {
if (s[i] != r[i]) {
return false;
}
}
return true;
}
int main()
{
string s;
cin >> s;
//如果本身即是回文串,那么直接输出即可
if (is_palindromic(s)) {
cout << s << " is a palindromic number." << endl;
return 0;
}
string r_s = s;
reverse(r_s.begin(), r_s.end());
for (int i = 0; i < 10; i++) {
string result = "";
int borrow = 0;//进位
for (int j = s.length() - 1; j >= 0; j--) {
//模拟加,并有进位
int signal_add = (s[j] - '0') + (r_s[j] - '0') + borrow;
borrow = signal_add / 10;
signal_add = signal_add % 10;
result += (signal_add + '0');
}
//最后一位进位,需要另外考虑
if (borrow > 0) {
result += ('0' + borrow);
}
reverse(result.begin(), result.end());//反转后才为正确的result
cout << s << " + " << r_s << " = " << result << endl;
//判断
if (is_palindromic(result)) {
cout << result << " is a palindromic number." << endl;
return 0;
}
s = result;
r_s = result;
reverse(r_s.begin(), r_s.end());//反转
}
//10次后输出
cout << "Not found in 10 iterations." << endl;
}