Consider a positive integer N written in standard notation with k+1 digits ai as ak ⋯a1 a0 with 0≤ai <10 for all i and ak >0. Then N is palindromic if and only if ai =ak−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来存储数字。用库函数快速实现拟置。
代码
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
void add(string &s1, string &s2){
int carry = 0;
for(int i = (int)s1.size() - 1, t ; i >= 0; i--){
t = (s1[i] - '0') + (s2[i] - '0') + carry;
s1[i] = t % 10 + '0';
carry = t / 10;
}
if(carry > 0) s1.insert(s1.begin(), carry + '0');
}
int main() {
string s, rs;
cin >> s;
// 预先创建一个拟置用于下面while的第一次判断
rs = s;
reverse(rs.begin(), rs.end());
int i = 0;
// 如果不是回文数字,则不断当前数字和它的逆置加起来,并输出过程的表达式
while (i < 10 && rs != s) {
// 输出表达式
cout << s << " + " << rs << " = ";
add(s, rs);
cout << s << endl;
// 更新拟置数字,累计次数
rs = s;
reverse(rs.begin(), rs.end());
i++;
}
if(i < 10){
cout << s << " is a palindromic number.";
}else{
cout << "Not found in 10 iterations.";
}
return 0;
}