[子集DP][Lucas定理] BZOJ 4903: [Ctsc2017]吉夫特

$Solution$

原来可以把简单的题面写的那么长~
根据Lucas定理，

$${n\choose m}\equiv {{\lfloor{n\over2}\rfloor}\choose{\lfloor{m\over2}\rfloor}}{n\bmod2\choose m\bmod 2}\pmod2$$ 有 $${0\choose0}=1,{0\choose1}=0,{1\choose0}=1,{1\choose1}=1$$ 那么当这个柿子成立当且仅当 $n~and~m=m$啦，那就可以DP了。
跑的真快

#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> Pairs;

const int N = 233333;
const int MOD = 1000000007;

inline char get(void) {
    static char buf[100000], *S = buf, *T = buf;
    if (S == T) {
        T = (S = buf) + fread(buf, 1, 100000, stdin);
        if (S == T) return EOF;
    }
    return *S++;
}
template<typename T>
inline void read(T &x) {
    static char c; x = 0; int sgn = 0;
    for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1;
    for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
    if (sgn) x = -x;
}

int f[N], a[N];
int n, U, ans;

inline void Add(int &x, int a) {
    x += a; while (x >= MOD) x -= MOD;
}

int main(void) {
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    read(n); U = 233333;
    for (int i = 1; i <= n; i++) read(a[i]);
    for (int i = 1; i <= n; i++) {
        for (int T = a[i]; T <= U; T = (T + 1) | a[i])
            Add(f[a[i]], f[T]);
        Add(ans, f[a[i]]); Add(f[a[i]], 1);
    }
    cout << ans << endl;
    return 0;
}