题解 | #反序数#

#include <cstdlib>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define min 1000
#define max 1111

int int_reverse(int in)
{
    string s = to_string(in);
    reverse(s.begin(), s.end());
    return atoi(s.c_str());
}

int main() {
    for (int i = min; i <= max; i++) {
        int j = int_reverse(i);
        if (j / i == 9 && j % i == 0)
            cout << i << endl;
    }
}
// 64 位输出请用 printf("%lld")