AcWing 1629. 延迟的回文数
原题链接
简单
作者:
整天睡大觉
,
2024-02-28 11:49:30
,
所有人可见
,
阅读 25
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
bool check(vector<int> &A){
for(int i = 0, j = A.size() - 1; i < j; i ++, j --){
if(A[i] != A[j]) return false;
}
return true;
}
void print(vector<int> &A){
for (int i = A.size() - 1; i >= 0; i -- ) cout << A[i];
}
vector<int> add(vector<int> &A, vector<int> &B){
int t = 0;
vector<int> C;
for (int i = 0; i < A.size() || i < B.size(); i ++ ){
if(i < A.size()) t += A[i];
if(i < B.size()) t += B[i];
C.push_back(t % 10);
t /= 10;
}
if(t) C.push_back(t);
return C;
}
int main()
{
string a;
cin >> a;
vector<int> A;
for (int i = a.size() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
for (int i = 0; i < 10; i ++ ){
if(check(A)) break;
vector<int> B(A.rbegin(), A.rend());
print(A), cout << " + ", print(B),cout << " = ";
A = add(A, B);
print(A), cout << endl;
}
if(check(A)) print(A), cout << " is a palindromic number." << endl;
else puts("Not found in 10 iterations.");
return 0;
}