一本通1624：樱花

我是小蒟蒻

于 2024-03-13 22:07:48 发布

阅读量409

点赞数 7

CC 4.0 BY-SA版权

文章标签：算法 c++

本文链接：https://blog.youkuaiyun.com/liu12345635/article/details/136693171

#include <cstdio>

const int MOD = 1000000007;
const int MAXN = 1000000 + 10;

bool notp[MAXN];

int main() {
    int i, j;
    int n, cnt, x, ans = 1;

    scanf("%d", &n);

    for (i = 2; i <= n; i++) {
        if (!notp[i]) {
            for (j = i * 2; j <= n; j += i)
                notp[j] = true;

            cnt = 0;

            for (x = n / i; x; x /= i)
                cnt += x;

            ans = ans * (2ll * cnt + 1) % MOD;
        }
    }

    printf("%d\n", ans);
    return 0;
}