摘要: int pr[N], pr_cnt, flg[N], mu[N], sum_mu[N]; void init() { mu[1] = 1; for (int i = 2; i < N; i ++) { if (!flg[i])pr[++pr_cnt] = i, mu[i] = -1; for (in 阅读全文
posted @ 2021-08-09 10:54 u_yan 阅读(36) 评论(0) 推荐(0) 编辑