1024 Palindromic Number (25 分)

1024 Palindromic Number (25 分)

题目入口：
https://pintia.cn/problem-sets/994805342720868352/problems/994805476473028608

思想

想了好久不知道错在哪
最后才知道这题还考大数相加…
emm第二段代码的long long是不行的
要仔细分析好题
明天再写吧
到这里讲解结束

AC代码

#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string Add(string A, string B);    //字符串形式加和
bool isPalindromic(string C);    //判断是否为回文数
int main() {
    string A, B, C;
    int cnt, step = 0, flag = 0;
    cin >> A >> cnt;
    if (isPalindromic(A)) { cout << A << endl << "0" << endl; return 0; } //开始即为回文数
    for (step = 1; step <= cnt; step++){
        B = A;
        reverse(B.begin(), B.end());    //得到原始数的逆转数
        C = Add(A, B);
        if (isPalindromic(C)) { flag = 1; break; }
        A = C;    //继续操作
    }
    if (flag) cout << C << endl << step << endl;
    else cout << C << endl << step-1 << endl;
    return 0;
}
string Add(string A, string B) {
    string C;
    int i = A.size() - 1;
    int Bas = 0, Adv = 0;
    while (i >= 0) {
        Bas = (A[i] - '0') + (B[i] - '0');    //当前位所得值
        C += (Adv + Bas) % 10 + '0';    //当前位终值
        Adv = (Adv + Bas) / 10;        //进位值
        --i;
    }
    if (Adv) C += (Adv + '0');    //若最后仍有进位值
    reverse(C.begin(), C.end());    //逆转得到两数和
    return C;
}
bool isPalindromic(string C) {
    int Len = C.size(), i;
    bool flag = true;
    for (i = 0; i < Len / 2; i++) if (C[i] != C[Len - 1 - i]) flag = false;
    return flag;
}

问题代码

include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long LL;
int Is_Palindromic(char s[]){
    int ret = 1;
    for (int i = 0; i < strlen(s)/2; i++){
        if (s[i] != s[strlen(s)-i-1]){
            ret = 0;
            break;
        }
    }
    return ret;
}
int main(){
    LL n, k;
    int step;
    scanf("%lld%lld", &n, &k);
    for (step = 0; step < k; step++){
        char s[20];
        sprintf(s, "%lld", n);
        if (Is_Palindromic(s)) break;
        else {
            reverse(s, s+strlen(s));
            LL reverse_n = atoll(s);
            n += reverse_n;
        }
    }
    printf("%lld\n%d\n", n, step);
    return 0;
}