02-22 17:02 华南理工大学 数据分析师 发布于广东
关注
反序数
#include <iostream>
using namespace std;
int reverse(int n) {
int k = 1000;
int rev = 0;
while (n) { //n为0时退出循环
rev = (n % 10) * k + rev;
k = k / 10;
n = (n - n % 10) / 10;
}
return rev;
}
int main() {
for (int i = 1000; i <= 9999; i++) {
if (i * 9 == reverse(i)) {
cout << i << endl;
}
}
return 0;
}
#include <iostream>
using namespace std;
int reverse(int n) {
int k = 1000;
int rev = 0;
while (n) { //n为0时退出循环
rev = (n % 10) * k + rev;
k = k / 10;
n = (n - n % 10) / 10;
}
return rev;
}
int main() {
for (int i = 1000; i <= 9999; i++) {
if (i * 9 == reverse(i)) {
cout << i << endl;
}
}
return 0;
}
我已经通过这道题！
https://gw-c.nowcoder.com/api/sparta/jump/link?link=https%3A%2F%2Fwww.nowcoder.com%2FquestionTerminal%2Fe0d06e79efa44785be5b2ec6e66ba898
全部评论
相关推荐
