for (int i = 2; i < n; ++i)
for (int j = i * 2; j < n; j += i)
isNotPrime[j] = 1;
质数判断
最新推荐文章于 2022-03-09 20:15:14 发布
for (int i = 2; i < n; ++i)
for (int j = i * 2; j < n; j += i)
isNotPrime[j] = 1;