题解 | 素数判断
素数判断
https://www.nowcoder.com/practice/5ab1b9690af047699e96c87dee65def4
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func main() {
sc := bufio.NewScanner(os.Stdin)
sc.Scan()
t, _ := strconv.Atoi(sc.Text())
n := make([]int, t)
for i := 0; i < t; i++ {
sc.Scan()
n[i], _ = strconv.Atoi(sc.Text())
if !isPrime(n[i]) {
fmt.Println("No")
} else {
fmt.Println("Yes")
}
}
}
func isPrime(n int) bool {
if n <= 1 {
return false
}
if n == 2 {
return true
}
if n%2 == 0 {
return false
}
for i := 3; i*i <= n; i += 2 {
if n%i == 0 {
return false
}
}
return true
}
查看9道真题和解析
