本文共 1266 字,大约阅读时间需要 4 分钟。
kotlin 判断数字
A prime number is a natural number that is greater than 1 and cannot be formed by multiplying two smaller natural numbers.
质数是大于1的自然数,不能通过将两个较小的自然数相乘而形成。
Given a number num, we have to check whether num is a prime number or not.
给定数字num ,我们必须检查num是否是质数。
Example:
例:
Input: num = 83 Output: 83 is a Prime Number
/** * Kotlin program to check given number is Prime Number or Not*/package com.includehelp.basicimport java.util.*//Function to check Prime Numberfun isPrimeNo(number: Int): Boolean { if(number<2) return false for (i in 2..number/2) { if (number % i == 0) { return false } } return true}//Main Function, Entry Point of Programfun main(arg: Array) { val sc = Scanner(System.`in`) //Input Number println("Enter Number : ") val num: Int = sc.nextInt() //Call Function to Check Prime Number if (isPrimeNo(num)) { println("$num is a Prime Number") } else { println("$num is not a Prime Number") }}
Output
输出量
RUN 1:Enter Number :8383 is a Prime Number---RUN 2:Enter Number :279279 is not a Prime Number---RUN 3:Enter Number :2929 is a Prime Number
翻译自:
kotlin 判断数字
转载地址:http://lotzd.baihongyu.com/