bzoj3209 花神的数论题 [数位dp]

Description:
求$\prod{countbit(i)}$

---

Solution:
枚举$1$的个数，数位$dp$即可。

---

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int P = 1e7 + 7;
int bit;
ll n, ans = 1;
int st[70];
ll dp[70][70];
ll power(ll x, ll t) {
    ll ret = 1;
    for(; t; t >>= 1, x = x * x % P) {
        if(t & 1) {
            ret = ret * x % P;
        }
    }
    return ret;
}
ll dfs(int bit, int limit, int c) {
    if(bit == 0) {
        return !c;
    }
    if(!limit && dp[bit][c] != -1) {
        return dp[bit][c];
    }
    int lim = limit ? st[bit] : 1;
    ll ret = 0;
    for(int i = 0; i <= lim; ++i) {
        ret += dfs(bit - 1, limit && i == lim, c - (i == 1));
    }
    return !limit ? dp[bit][c] = ret : ret;
}
int main() {
    memset(dp, -1, sizeof(dp));
    scanf("%lld", &n);
    while(n) {
        st[++bit] = n & 1;
        n >>= 1;
    }
    for(int i = 1; i <= 65; ++i) {
        ans = ans * power(i, dfs(bit, 1, i)) % P;
    }
    printf("%lld\n", ans);
    return 0;
}