wanngwe/Learn-Algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
master
Learn-Algorithms/9 Algorithms Job Interview/4.5 数值-素树.md
T
ranwenjie fc99cdfa71 update i9w
2021-09-20 13:28:54 +08:00

186 B
Raw Permalink Blame History

数值-素树

如果一个数如果只能被 1 和它本身整除，那么这个数就是素数

返回区间 [2, n) 中有几个素数

int countPrimes(int n)
Reference in New Issue View Git Blame Copy Permalink