B1024 Palindromic Number(大数加)

B1024 Palindromic Number (25分)

• N and K, where N (≤10^​10) is the initial numer and K (≤100) is the maximum number of steps.
  数据范围，对于n不会超int，但是多次累加后就有可能会超过int,字符反转类型直接用string中的reverse处理方便。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string.h>
#include <cmath>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
using namespace std;
const int MAX=1001;
const int INF=0x3f3f3f3f;
string s1,s2;
int k;
int main()
{
    int tol=1;
    cin>>s1;
    scanf("%d",&k);
    while(tol<=k)
    {
        s2=s1;
        reverse(s2.begin(),s2.end());
        if(s1==s2)
           break;
        else
        {
            tol++;
            int carry=0;
            string s3="";
            for(int i=s1.length()-1;i>=0;i--)
            {
                int num=(s1[i]-'0')+(s2[i]-'0')+carry;
                carry=num/10;
                s3+=(num%10+'0');
            }
            if(carry>0)
            {
                s3+=(carry+'0');
            }
            reverse(s3.begin(),s3.end());
            s1=s3;
        }
    }
    cout<<s1<<endl;
    cout<<tol-1;
    return 0;
}