A1136
Description:
给出一个数字,判断是否为回文数,若是则输出,不是则将该数与其反转后的数加和,直到和为回文数为止,累计10次加和仍未形成,则输出失败信息;
思路:
- 由于数字字符串“低位高下标”的性质,做求和运算前要将字符串反转;
- 求和时考虑进位;
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
using namespace std;
string a, b, sum;
bool isp(string a){ //判断一字符串是否为回文
int len = a.size(); //将字符串长度保存
for(int i = 0; i+i < len; i++)
if(a[i] != a[len-i-1]) return false;
return true;
}
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("1.txt", "r", stdin);
#endif // ONLINE_JUDGE
cin>>a;
int i = 0;
while(!isp(a) && i < 10){
b = a; //注意低位高下标
reverse(a.begin(), a.end()); //由于数字低位高下标,所以反转
printf("%s + %s = ", b.c_str(), a.c_str());
int c = 0, dig; //c为进位位,dig暂存每位和
int len = a.size();
for(int in = 0; in < len; in++){ //由低向高运算
dig = (a[in]-'0')+(b[in]-'0') + c;
a[in] = dig%10 + '0';
c = dig/10;
}
if(c != 0) a += "1";
reverse(a.begin(), a.end()); //计算完毕将a反转至可输出状态
i++;
printf("%s\n", a.c_str());
}
if(i < 10) printf("%s is a palindromic number.", a.c_str()); //是P
else printf("Not found in 10 iterations.");
return 0;
}