问题描述
153是一个非常特殊的数,它等于它的每位数字的立方和,即153=1*1*1+5*5*5+3*3*3。编程求所有满足这种条件的三位十进制数。
输出格式
按从小到大的顺序输出满足条件的三位十进制数,每个数占一行。
import java.util.Scanner;
public class Main {
public static int sum(int a, int b, int c) {
int sum = 0;
sum = a * a * a + b * b * b + c * c * c;
return sum;
}
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int a = 0, b = 0, c = 0, i, num;
for (num = 100; num <= 999; num++) {
a = num / 100;
b = (num / 10) % (a * 10);
c = num % 10;
if (num == sum(a, b, c)) {
System.out.println(num);
}
}
}
}
测试输出:
153
370
371
407