问题描述:水仙花数是一种特殊的三位数,它的特点就是,每个数位的立方和,等于它本身。比如153就是水仙花数。因为:13+53+33 =153 100~999之内,只有4个水仙花数,请编程找出来
代码如下:
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>水仙花数</title>
</head>
<body>
<script>
for (var i = 100; i < 999; i++) {
a = parseInt(i / 100);
a1 = parseInt(i % 100);
b = parseInt(a1 / 10);
c = parseInt(a1 % 10);
sum = parseInt(Math.pow(a, 3) + Math.pow(b, 3) + Math.pow(c, 3));
if (i == sum) {
document.write(i);
}
}
</script>
</body>
</html>