OpenJudge . NOI / 1.4编程基础之逻辑表达式与条件分支

OpenJudge - NOI - 首页  链接

01:判断数正负

<script type="" id="ch0104/01">

var n = +prompt()

if(n > 0) {
console.log('positive')
} else if (n == 0) {
console.log('zero')
} else {
console.log('negative')
}


</script>

02:输出绝对值

<script type="x" id="ch0104/02">

var n = +prompt()
var absolute = n

if (n == absolute) {
  console.log(Math.abs(absolute.toFixed(2)))
}

//做法二:
// var n = +prompt()
// if (n < 0) {
//console.log(-n)
//} else {
//console.log(n)
//}


</script>

03:奇偶数判断

<script type="x" id="ch0104/03">

var n = +prompt()

if (n % 2 == 0) {
  console.log('even')
} else {
  console.log('odd')
}



</script>

04:奇偶ASCII值判断

<script type="x" id="ch0104/04">

var A = +prompt()

if (A % 2 !== 0) {
  console.log('YES')
} else {
  console.log('NO')
}


</script>

05:整数大小比较

<script type="x" id="ch0104/05">

var x = +prompt()
var y = +prompt()

if (x > y){
  console.log('>')
} else if (x == y) {
  console.log('=')
} else {
  console.log('<')
}


</script>

06:判断是否为两位数

<script type="" id="ch0104/06">

var n = +prompt()

if (n >= 10 && n < 100) {
console.log(1)
} else {
  console.log(0)
}


</script>

07:收集瓶盖赢大奖

<script type="x" id="ch0104/07">
var n = +prompt()
var m = +prompt()

if (n >= 10 || m >= 20) {
  console.log('1')
} else {
  console.log('0')
}



</script>

判断一个数能否同时被3和5整除

<script type="x" id="ch0104/08">

 var n = Number(prompt())

  if (n % 3 == 0 && n % 5 == 0) {
    console.log('YES')
  } else {
    console.log("NO")
  }

</script>

09:判断能否被3,5,7整除

<script type="x" id="ch0104/09">

var n = Number(prompt())

  if (n % 3 == 0 && n % 5 == 0 && n % 7 == 0) {
    console.log('3 5 7')
  } else if (n % 3 == 0 && n % 5 == 0) {
    console.log('3 5')
  } else if (n % 3 == 0 && n % 7 == 0) {
    console.log('3 7')
  } else if (n % 5 == 0 && n % 7 == 0) {
    console.log('5 7')
  } else if (n % 3 == 0) {
    console.log('3')
  } else if (n % 5 == 0) {
    console.log('5')
  } else if (n % 7 == 0) {
    console.log('7')
  } else {
    console.log('n')
  }


// 解法二

 var n = Number(prompt())

  if (n % 3 == 0 || n % 5 == 0 || n % 7 == 0) {
    if (n % 3 == 0) {
      console.log(3)
    }

    if (n % 5 == 0) {
      console.log(5)
    }

    if (n % 7 == 0) {
      console.log(7)
    }
  } else {
    console.log('n')
  }


// 解法三

  var n = Number(prompt())

  var flag = false

  if (n % 3 == 0) {
    flag = true
    console.log(3)
  }

  if (n % 5 == 0) {
    flag = true
    console.log(5)
  }

  if (n % 7 == 0) {
    flag = true
    console.log(7)
  }

  if (!flag) {
    console.log('n')
  }



</script>

10:有一门课不及格的学生

<script type="x" id="ch0104/10">

var n = +prompt()
var m = +prompt()

if (n < 60 && m >= 60 || n >= 60 && m < 60 ) {
  console.log('1')
} else {
  console.log('0')
}




</script>

11:晶晶赴约会

<script type="x" id="ch0104/11">

var n = +prompt()

if (n == 1 || n == 3 || n ==5) {
  console.log('NO')
} else {
  console.log('YES')
}


</script>

12:骑车与走路

<script type="" id="ch0104/12">
var distance = Number(prompt())

  var byWalk = distance / 1.2
  var byBike = distance / 3 + 50

  if (byWalk < byBike) {
    console.log('Walk')
  } else if (byWalk > byBike) {
    console.log('Bike')
  } else {
    console.log('All')
  }


</script>

13:分段函数

<script type="" id="ch0104/13">

var x = +prompt()
var y
if (x >= 0 && x < 5) {
  y = -x + 2.5
} else if (x >= 5 && x < 10) {
  y = 2 - 1.5 * (x - 3) * (x - 3)
} else if (x >= 10 &&  x < 20) {
  y = x / 2 - 1.5
}

console.log(y.toFixed(3))


</script>

14:计算邮资

<script type="x" id="ch0104/14">

var weight = Number(prompt())  //重量
  var emergency = prompt() //表示是否加急
  var price  // 价格

  if (emergency == 'y') {
    if (weight > 1000) {
      price = 8 + Math.ceil((weight - 1000) / 500) * 4 + 5
    } else {
      price = 8 + 5
    }
  } else {
    if (weight > 1000) {
      price = 8 + Math.ceil((weight - 1000) / 500) * 4
    } else {
      price = 8
    }
  }

  console.log(price)

</script>

15:最大数输出

<script type="x" id="ch0104/15">

var a = +prompt()
var b = +prompt()
var c = +prompt()
var max = 0

if (a > max) {
  max = a
}
if (b > max) {
  max = b
}
 if (c > max) {
  max = c
}
console.log(max)

</script>

16:三角形判断

<script type="" id="ch0104/16">

var a = +prompt()
var b = +prompt()
var c = +prompt()

if (a + b > c && a + c > b && b + c > a) {
  console.log('YES')
} else {
  console.log('NO')
}



</script>

17:判断闰年

<script type="" id="ch0104/17">


var year = +prompt()

if (year % 400 == 0 || (year % 4 == 0 && year % 100 !== 0)) {
  console.log('y')
} else {
  console.log('n')
}



</script>

18:点和正方形的关系

<script type="x" id="ch0104/18">

var x = +prompt()
var y = +prompt()

if (x > -1 && x < 1 && y > -1 && y < 1) {
  console.log('yes')
} else {
console.log('no')
}



</script>

19:简单计算器

<script type="x" id="ch0104/19">
  var a = Number(prompt())
  var b = Number(prompt())
  var op = prompt()

  if (op == '+') {
    console.log(a + b)
  } else if (op == '-') {
    console.log(a - b)
  } else if (op == '*') {
    console.log(a * b)
  } else if (op == '/') {
    if (b == 0) {
      console.log('Divided by zero!')
    } else {
      console.log(a / b)
    }
  } else {
    console.log('Invalid operator!')
  }


</script>

20:求一元二次方程的根

<script type="x" id="ch0104/20">

var a = Number(prompt())
  var b = Number(prompt())
  var c = Number(prompt())

  var delta = b * b - 4 * a * c
  var delta = b * b - 4 * a * c

  if (delta >= 0) {
    var x1 = (-b + Math.sqrt(delta)) / (2 * a)
    var x2 = (-b - Math.sqrt(delta)) / (2 * a)

    if (delta > 0) {
      var result = 'x1=' + x1.toFixed(5) + ';x2=' + x2.toFixed(5)
    } else {
      var result = 'x1=x2=' + x1.toFixed(5)
    }
  } else {
    delta = -delta
    var sDelta = Math.sqrt(delta)

    var x1real = -b / (2 * a) // x1的实部
    var x1imag = sDelta / (2 * a)// x1的虚部
    var x2real = -b / (2 * a) // x1的实部
    var x2imag = -sDelta / (2 * a)// x1的虚部

    var x1 = x1real.toFixed(5) + (x1imag > 0 ? '+' : '') + x1imag.toFixed(5) + 'i'
    var x2 = x2real.toFixed(5) + (x2imag > 0 ? '+' : '') + x2imag.toFixed(5) + 'i'

    var result = 'x1=' + x1 + ';x2=' + x2
  }
  console.log(result)


</script>

21:苹果和虫子2

<script type="x" id="ch0104/21">


var n = +prompt()
var x = +prompt()
var y = +prompt()
var and = parseInt(n - y / x)

if (n * x <= y){
  console.log(0)
} else{
  console.log(and)
}


</script>

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值