牛客 - 回文数（十六进制高精度）

题目

题目链接

参考代码

//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<sstream>
#include<map>
using namespace std;
typedef long long ll;

const int nn = 1e4 + 5;

int n;
string s;
map<char, int> m = {{'0', 0}, {'1', 1}, {'2', 2}, {'3', 3}, {'4', 4}, {'5', 5}, {'6', 6}, {'7', 7}, {'8', 8}, {'9', 9}, {'A', 10}, {'B', 11}, {'C', 12}, {'D', 13}, {'E', 14}, {'F', 15}};
map<int, char> m2 = {{0, '0'}, {1, '1'}, {2, '2'}, {3, '3'}, {4, '4'}, {5, '5'}, {6, '6'}, {7, '7'}, {8, '8'}, {9, '9'}, {10, 'A'}, {11, 'B'}, {12, 'C'}, {13, 'D'}, {14, 'E'}, {15, 'F'}};
string f(string a, string b, int k) {
    std::vector<int> v;
    std::vector<char> v1;
    string x, y;
    int t = 0;
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    switch (k) {
    case 2: case 3: case 4: case 5: case 6: case 7: case 8: case 9: case 10:
        for (int i = 0; i < (int)a.size() || i < (int) b.size(); i++) {
            if (i < (int)a.size()) t += (a[i] - '0');
            if (i < (int)b.size()) t += (b[i] - '0');
            v.push_back(t % k);
            t /= k;
        }
        if (t) v.push_back(1);
        break;
    case 16:
        for (int i = 0; i < (int)a.size() || i < (int) b.size(); i++) {
            if (i < (int)a.size()) {
                t += (m[a[i]]);
            }


            if (i < (int)b.size()) {
                t += (m[b[i]]);
            }
            v1.push_back(m2[t % 16]);
            t /= 16;
        }
        if (t) v1.push_back('1');
        break;
    }
    string res = "";
    if (k != 16) {
        while (!v.empty()) {
            res.push_back(v.back() + '0');
            v.pop_back();
        }
    } else {
        while (!v1.empty()) {
            res.push_back(v1.back());
            v1.pop_back();
        }
    }
    return res;
}
bool flg = 0;
int main(void) {
    cin >> n >> s;
    string k=s;
    reverse(k.begin(), k.end());
    int cnt = 1;
    for (int i = 0; i < 30; i++, cnt++) {
        string kk = k;
        reverse(kk.begin(), kk.end());
        k = f(k, kk, n); 
        kk = k; 
        reverse(kk.begin(), kk.end());
        //注意这里有bug，由于是使用string存的数字，所以没有考虑像120这样反转后有前缀0的情况
        //但是oj上似乎并没有测试这个
        //随便试着交了一下就过了，也就懒得改了
        //读者需要留心一下这个bug
        if (k == kk) {
            flg = 1;
            break;
        }
    }

    if (flg)
        cout << "STEP=" << cnt << endl;
    else
        cout << "Impossible!" << endl;

    return 0;
}

解题思路

很简单，纯菜鸡做法，主要是练习一下高精度
用两个map模拟了一下十六进制的加法
代码显得有点冗长，应该四十行左右就能写好了

注意事项

有一个很简单的bug在代码里，但是不管这个bug也能AC，就懒得改了，具体bug写在注释里了