题解 | #反序数#

#include <cstdio>
using namespace std;

int main() {
    int N;
    for (int a = 1; a <= 9; a++) {
        for (int b = 0; b <= 9; b++) {
            for (int c = 0; c <= 9; c++) {
                for (int d = 1; d <= 9; d++) {
                    N = a * 1000 + b * 100 + c * 10 + d; 
                    if (N * 9 == d * 1000 + c * 100 + b * 10 + a)
                    cout<<N<<endl;
                }
            }
        }
    }
    return 0;
}