摘要: bool IsPrime(uint64_t n) { bool r = (n != 1); if (n > 2) { uint64_t lm = sqrt(n); for (uint64_t i = 2; i <= lm; i++){ if (n % i == 0) { r = false; bre 阅读全文
posted @ 2023-09-23 13:04 iamy 阅读(56) 评论(0) 推荐(0)