签到题给搞了半天,一开始我没看到数据范围要到1000。后面看到了这个之后根本就开始改了,longlong会爆炸数据范围只能得18分,最后一个测试点过不去。
于是呢就放弃用longlong,自己写了一个高精度的加法(用string),代码有点长。愿意看的同学就看一看吧。
//
// Created by 曾仕邦 on 2021/9/10.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
bool check(string s){ //检查是否为回文串
for (int i = 0; i < s.size()/2; ++i) {
if (s[i]!=s[s.size()-i-1])
return false;
}
return true;
}
string reverse(string a){ //字符串翻转
for (int i = 0; i < a.size()/2; ++i) {
swap(a[i],a[a.size()-1-i]);
}
return a;
}
string add(string a,string b){ //高精度加法
string s;
for (int i = a.size()-1; i >= 0; --i) {
if (a[i]+b[i]-2*'0'<10){
if (s.size()<a.size()-i){
s+=a[i]+b[i]-'0';
}
else {
if (a[i]+b[i]+s[a.size()-i-1]-3*'0'<10){
s[a.size()-i-1]+=a[i]+b[i]-2*'0';
}else{
s[a.size()-i-1]+=a[i]+b[i]-2*'0'-10;
s+='1';
}
}
}else{
if (s.size()<a.size()-i)
{
s+='0';
s[a.size()-i-1]+=a[i]+b[i]-2*'0'-10;
s+='1';
}
else {
s[a.size()-i-1]+=a[i]+b[i]-2*'0'-10;
s+='1';
}
}
}
return reverse(s);
}
int main(){
string s;int cnt=0;
cin>>s;
while(!check(s)){
cout<<s<<" + "<<reverse(s)<<" = "<<add(s, reverse(s))<<endl;
s = add(s, reverse(s));
cnt++;
if (cnt==10){
puts("Not found in 10 iterations.");
return 0;
}
}
cout<<s<<" is a palindromic number.";
}