【PAT乙级】1079 延迟的回文数 (20 分)

题目地址

#include<bits/stdc++.h>
using namespace std;
string a;
vector<int>A,B,C; 
void print(vector<int> A){ for(int i=A.size()-1;i>=0;i--) cout<<A[i];}
bool check(vector<int> ve)
{
	int len=ve.size()/2;
	for(int i=0;i<len;i++) if(ve[i]!=ve[ve.size()-1-i]) return false;
	return true;
}
vector<int> add(vector<int> A,vector<int> B)
{
	vector<int> C;
	int t=0;
	for(int i=0;i<A.size();i++)
	{
		t+=A[i]+B[i];
		C.push_back(t%10);
		t/=10;
	}
	if(t) C.push_back(1);
	return C;
}
int main(void)
{
	cin>>a;
	for(int i=a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
    if(check(A)) 
    {
        print(A);
		cout<<" is a palindromic number.";
		return 0;
    }
	for(int i=0;i<10;i++)
	{
		B=A; reverse(B.begin(),B.end());
		C=add(A,B);
		print(A); cout<<" + "; print(B); cout<<" = "; print(C); cout<<endl;
		if(check(C)) 
		{
			print(C);
			cout<<" is a palindromic number.";
			return 0;
		}
		A=C;
	}
	cout<<"Not found in 10 iterations.";
	return 0;
}