题解 | 反序数
反序数
https://www.nowcoder.com/practice/e0d06e79efa44785be5b2ec6e66ba898
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int temp = 0, k = 0, weigh = 0;
for (int i = 1000; i <= 9999; i++) {
k = i;
temp = 0;
for (int j = 4; j >= 1; j--) {
weigh = k % 10;
k = k / 10;
temp += pow(10, j - 1) * weigh;
}
if (i * 9 == temp) {
cout << i << endl;
}
}
return 0;
}
#考研##复试练习#2025考研复试 文章被收录于专栏
复试ing，努力中。。。
韶音科技二面153人在聊
