PATA1136_简单但有坑点

如果输入的就是回文数，直接输出即可。测试点2，3，4就是这个。不仔细读题就掉坑里了。

放了两个版本，第一个是之前写的比较短。

#include <bits/stdc++.h>
using namespace std;
int flag = 0, cnt = 0;
void pr (string s) {
    // cout << cnt << endl;
    if (flag == 1) return;
    if (cnt == 10){
        cout << "Not found in 10 iterations.";
        flag = 1;
        return;
    }
    string a, b, ans;
    a = b = s;
    reverse (a.begin(), a.end());
    // cout << a << "    " << b << endl;
    if (a == b) {
        printf ("%s is a palindromic number.", a.c_str());
        flag = 1;
        return;
    }
    int more = 0;
    for (int i = s.size() - 1; i >= 0; i--) {
        int x = a[i] - '0', y = b[i] - '0';
        int now = (x + y + more) % 10;
        more = (x + y + more) / 10;
        ans.push_back('0' + now);
    }
    if (more != 0) ans.push_back('0' + more);
    reverse (ans.begin(), ans.end());
    cout << b << " + " << a << " = " << ans << endl;
    cnt++;
    pr(ans);
}
int main() {
    string s;
    cin >> s;
    pr(s);
}

第二个是后来写的，没用reverse函数自己写了。

#include<bits/stdc++.h>
using namespace std;
bool isPail (string s) {
    for (int i = 0, j = s.size() - 1; i < s.size() / 2 && i < j; i++, j--) {
        if (s[i] != s[j]) return false;
    }
    return true;
}
string revers(string s) {
    for (int i = 0, j = s.size() - 1; i < s.size() / 2 && i < j; i++, j--) {
        char c = s[i];
        s[i] = s[j];
        s[j] = c;
    }
    return s;
}
string addS (string s, string sr) {
    int flag = 0;
    string ans;
    for (int i = s.size() - 1; i >= 0; i--) {
        int a = s[i] - '0', b = sr[i] - '0';
        ans += '0' + (a + b + flag) % 10;
        if (a + b + flag > 9) flag = 1;
        else flag = 0;
    }
    if (flag == 1) ans += '1';
    return revers(ans);
}
int main() {
    string s, sr, ans;
    int flag = 0;
    cin >> s;
    for (int i = 0; i < 10; i++){
        sr = revers(s);
        ans = addS (s, sr);
        if (s == sr) {
            printf ("%s is a palindromic number.", s.c_str());
            flag = 1;
            break;
        }
        printf ("%s + %s = %s\n", s.c_str(), sr.c_str(), ans.c_str());
        if (ans == revers(ans)) {
            printf ("%s is a palindromic number.", ans.c_str());
            flag = 1;
            break;
        }
        s = ans;
    }
    if (flag == 0) printf ("Not found in 10 iterations.");
}