用string读入来回倒吧,写个简单的加法就好。
#include <iostream>
#include <cstring>
#include <climits>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
using namespace std;
string n;
bool isPal(string s){
string ans;
for(int i = 0 ; i < s.size() ;i++){
int j = s.size() - 1 - i;
if(s[i] != s[j])
return false;
}
return true;
}
string add(string s){
string s2,ans,ansf;
int c = 0;//carry digit
int a = 0;
for(int i = s.size() - 1 ; i >= 0 ;i--){
int j = s.size() - 1 - i;
s2.push_back(s[i]);
a = c + s[i] - '0' + s[j] - '0';
c = a /10;
a %= 10;
ans.push_back('0' + a);
}
if(c != 0)
ans.push_back('0' + c);
for(int i = ans.size() - 1; i >= 0 ; i--){
ansf.push_back(ans[i]);
}
cout << s << " + " << s2 << " = " << ansf << endl;
return ansf;
}
int main(){
cin >> n;
bool tag = false;
for(int i = 0 ; i < 10 ; i++){
if(isPal(n)){
cout << n << " is a palindromic number." << endl;
return 0;
}
else{
n = add(n);
}
}
cout << "Not found in 10 iterations." << endl;
return 0;
}