题解 | 反序数

#include <iostream>
using namespace std;

int Reverse(int n) {
    int remain, reverse = 0;
    while (true) {
        remain = n % 10;
        n = n / 10;
        reverse = reverse * 10 + remain;
        if (n == 0) {
            break;
        }
    }
    return reverse;
}
int main() {
    for (int i = 1000; i < 9999; i++) {
        if (i * 9 == Reverse(i))
            printf("%d\n", i);
    }
    return 0;
}
// 64 位输出请用 printf("%lld")