[NOI 2015] bzoj4197 寿司晚宴 [dp]

Description:
$n$个数，挑出一些分成两组，可以为空，问两组中所有数都与另一组互质。

---

Solution:
关于质因子分类，只考虑根号下的质因子，只有$8$个，那么装压一下，对于大于根号的分组考虑，单独$dp$即可。

---

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int p[] = {2, 3, 5, 7, 11, 13, 17, 19};
int n, P, ans;
int dp[1 << 9][1 << 9], g[2][1 << 9][1 << 9];
pair<int, int> a[505];
void u(int &x, int y) {
    x = (x + y) % P;
}
int main() {
    scanf("%d%d", &n, &P);
    for(int i = 2; i <= n; ++i) {
        int t = i;
        for(int j = 0; j < 8; ++j) {
            if(t % p[j] == 0) {
                a[i].second |= 1 << j;
                while(t % p[j] == 0) {
                    t /= p[j];
                }
            }
        }
        a[i].first = t;
    }
    sort(a + 2, a + n + 1);
    dp[0][0] = 1;
    for(int i = 2; i <= n; ++i) {
        if(a[i].first == 1 || a[i].first != a[i - 1].first) {
            for(int S0 = 0; S0 < 1 << 8; ++S0) {
                for(int S1 = 0; S1 < 1 << 8; ++S1) {
                    g[0][S0][S1] = g[1][S0][S1] = dp[S0][S1];
                }
            }
        }
        for(int S0 = (1 << 8) - 1; ~S0; --S0) {
            for(int S1 = (1 << 8) - 1; ~S1; --S1) {
                if(!(S0 & S1)) {
                    if(!(S1 & a[i].second)) {
                        u(g[0][S0 | a[i].second][S1], g[0][S0][S1]); 
                    }
                    if(!(S0 & a[i].second)) {
                        u(g[1][S0][S1 | a[i].second], g[1][S0][S1]);
                    }
                }
            }
        }
        if(a[i].first == 1 || a[i].first != a[i + 1].first) {
            for(int S0 = 0; S0 < 1 << 8; ++S0) {
                for(int S1 = 0; S1 < 1 << 8; ++S1) {
                    if(!(S0 & S1)) {
                        dp[S0][S1] = ((g[0][S0][S1] + g[1][S0][S1] - dp[S0][S1]) % P + P) % P;
                    }
                }
            }   
        }
    }
    for(int S0 = 0; S0 < 1 << 8; ++S0) {
        for(int S1 = 0; S1 < 1 << 8; ++S1) {
            if(!(S0 & S1)) {
                u(ans, dp[S0][S1]);
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}

感想：
看见这种约数相关想想质因子，后面分类比较巧妙