题解 | #变种水仙花#
变种水仙花
https://www.nowcoder.com/practice/c178e3f5cc4641dfbc8b020ae79e2b71
#include <stdio.h>
int main() {
long i, j;
int left, right;
int sum;
for (i = 10000; i <= 99999; i++) {
left = 0;
right = 0;
sum = 0;
for (j = 10; j <= i * 10; j *= 10) {
if (i % j <= i) {
right = i % j;
left = (i - right) / j;
sum = sum + (right * left);
}
}
if (sum == i) {
printf("%ld ", i);
}
}
return 0;
}
#题解#
查看7道真题和解析