1.判断num是不是一个质数代码以及网页如下
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title></title>
</head>
<body>
<script>
let num = parseInt(prompt("请输入一个整数"))
function isPrime(num) {
let isPrime = true
for (i = 2; i < num; i++) {
if (num % i == 0) {
isPrime = false
break
}
if (isPrime) {
return num + "是质数"
} else {
return num + "不是质数"
}
}
}
console.log(isPrime(num))
</script>
</body>
</html>
2.利用isPrime函数找出100-999之间的质数代码以及网页如下
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title></title>
</head>
<body>
<script>
function isPrime(num) {
for (let i = 100; i < 999; i++) {
let f = true;
for (let j = 2; j < i; j++) {
if (i % j == 0) {
f = false;
break;
}
}
if (f) {
console.log(i);
}
}
}
isPrime();
</script>
</body>
</html>
3.找出1000以内的水仙花数代码以及网页如下
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title></title>
</head>
<body>
<script>
let a, b, c, num;
for (num = 100; num < 1000; num++) {
a = parseInt(num / 100);
b = parseInt(num % 100 / 10);
c = parseInt(num % 100 %10);
if (num == a * a * a + b * b * b + c * c * c) {
console.log(num);
}
}
</script>
</body>
</html>
173
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
