约数个数&&约数和线性筛--板子

最新推荐文章于 2022-10-30 16:57:27 发布

three trees

最新推荐文章于 2022-10-30 16:57:27 发布

阅读量186

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/qq_43101466/article/details/102468808

版权

数论专栏收录该内容

32 篇文章 1 订阅

订阅专栏

约数个数

const int N = 1e6 + 5;
int sum[N], d[N], prime[N], tot;
bool mark[N];
void get_d()
{
    mark[0] = mark[1] = true;
    tot = 0;
    sum[1] = d[1] = 1;
    for(int i = 2; i < N; i ++)
    {
        if(!mark[i])
        {
            prime[tot ++] = i;
            d[i] = 2;
            sum[i] = 1;
        }
        for(int j = 0; j < tot && i * prime[j] < N; j ++)
        {
            mark[i * prime[j]] = true;
            if(i % prime[j] == 0)
            {
                d[i * prime[j]] = d[i] / (sum[i] + 1) * (sum[i] + 2);
                sum[i * prime[j]] = sum[i] + 1;
                break;
            }
            sum[i * prime[j]] = 1;
            d[i * prime[j]] = 2 * d[i];
        }
    }
}

前缀和： $\sum_{i=1}^{n}d(i)=\sum_{i=1}^{n}\lfloor\frac{n}{i}\rfloor$

例题：bzoj1968

约数和

const int N = 1e6 + 5;
ll sd[N], sp[N];
int prime[N], tot;
bool mark[N];
void get_sd()
{
    mark[0] = mark[1] = true;
    tot = 0;
    sd[1] = sp[1] = 1;
    for(int i = 2; i < N; i ++)
    {
        if(!mark[i])
        {
            prime[tot ++] = i;
            sd[i] = sp[i] = i + 1;
        }
        for(int j = 0; j < tot && i * prime[j] < N; j ++)
        {
            mark[i * prime[j]] = true;
            if(i % prime[j] == 0)
            {
                sd[i * prime[j]] = sd[i] / sp[i] * (sp[i] * prime[j] + 1);
                sp[i * prime[j]] = sp[i] * prime[j] + 1;
                break;
            }
            sd[i * prime[j]] = sd[i] * (prime[j] + 1);
            sp[i * prime[j]] = prime[j] + 1;
        }
    }
}