JS-01

JS

1.计算2的n次幂，n可输入，n为自然数。
var mul = 1;
var n = parseInt(window.prompt(“input”));
for(var i = 0; i <n; i++){
mul *= 2;
}
document.write(mul);

2.计算n的阶乘，n可输入。
阶乘：5！5 * 4 * 3 * 2 * 1
var ne = 1;
var n = parseInt(window.prompt(“input”));
for (i = 1; i <= n; i ++){
ne *= i;
}
document.write(ne)

3.著名的裴波那契额数列 1 1 2 3 5 8输出第n项
已知前两位，第三位为前两位的和
var n = parseInt(window.prompt(“input”));
var f = 1;
var s = 1;
if(n > 2){
for (i = 2; i < n; i ++){
var t = s + f;
f = s;
s = t;
}
document.write(t);
}else {
document.write(1);
}

4.编写一程序，输入一个三位数的正整数，输出时反向输出。如输入456，输出654
var a = parseInt(window.prompt(“input”));

var num = 456;
var b = num % 10;
var s = (num - b) / 10 % 10;
var g = (num - b - s * 10) / 100 % 10;
console.log(b * 100 + s * 10 + g);

5.输入a,b,c三个数字，打印出最大的
var a = parseInt(window.prompt(“input”));
var b = parseInt(window.prompt(“input”));
var c = parseInt(window.prompt(“input”));
if(a > b && a > c){
document.write(a);
}else if(b > c && b > a){
document.write(b);
}else{
document.write©;
}

6.打印出100以内的质数。（素数只能背1和自身整除，1除外）是否只有两次被整除
var count = 0;
for(var i = 1; i < 100; i ++){
for(var j = 1; j <= i; j ++){
if(i % j == 0){
count ++;
}
}
if(count == 2){
document.write(i + ’ ');
}
count = 0;
}

var count = 0;
for(var i = 1; i < 100; i ++){
for(var j = 1; j <= math.sqrt(i); j ++){
if(i % j == 0){
count ++;
}
}
if(count == 1){
document.write(i + ’ ');
}
count = 0;
}