FWT

FWT 与或非 模板：

P4717 【模板】快速沃尔什变换 (FWT)
PS：取模操作常数较大，根据题目删改

#include<bits/stdc++.h>
#define rint register int
#define deb(x) cerr<<#x<<" = "<<(x)<<'\n';
using namespace std;
typedef long long ll;
typedef pair <int,int> pii;
const ll mod = 998244353;
const int INV = 499122177;
const int maxn = 1e6 + 5;
int n, a[maxn], b[maxn];
int f[maxn], g[maxn];

inline int add(int x, int y) {
	int ret = x + y; while(ret >= mod) ret -= mod;
	while(ret < 0) ret += mod; return ret;
}

inline void fwt1(int *f, int type) {		// or
	for(int mid=1; mid<n; mid<<=1)
		for(int j=0,len=mid<<1; j<n; j+=len)
			for(int k=j; k<mid+j; ++k)
				f[mid+k] = add(f[mid+k], type*f[k]);
}

inline void fwt2(int *f, int type) {		// and
	for(int mid=1; mid<n; mid<<=1)
		for(int j=0,len=mid<<1; j<n; j+=len)
			for(int k=j; k<mid+j; ++k)
				f[k] = add(f[k], type*f[k+mid]);
}

inline void fwt3(int *f, int type) {		// xor
	int x, y;
	for(int mid=1; mid<n; mid<<=1)
		for(int j=0,len=mid<<1; j<n; j+=len)
			for(int k=j; k<mid+j; ++k) {
				x = f[k]; y = f[k+mid];
				f[k] = add(x, y); f[k+mid] = add(x, -y);
				if(type==-1) f[k]=(ll)f[k]*INV%mod, f[k+mid]=(ll)f[k+mid]*INV%mod;
			}
}

signed main() {
	scanf("%d", &n); n = 1 << n;
    for(int i=0; i<n; i++) scanf("%d", a+i), f[i] = a[i];
    for(int i=0; i<n; i++) scanf("%d", b+i), g[i] = b[i];
    fwt1(f, 1); fwt1(g, 1);
    for(int i=0; i<n; i++) f[i] = 1ll * f[i] * g[i] % mod;
    fwt1(f, -1);
    for(int i=0; i<n; i++) printf("%d ", f[i]); puts("");
    
    for(int i=0; i<n; i++) f[i] = a[i], g[i] = b[i];
    fwt2(f, 1); fwt2(g, 1);
    for(int i=0; i<n; i++) f[i] = 1ll * f[i] * g[i] % mod;
    fwt2(f, -1);
    for(int i=0; i<n; i++) printf("%d ", f[i]); puts("");
    
    for(int i=0; i<n; i++) f[i] = a[i], g[i] = b[i];
    fwt3(f, 1); fwt3(g, 1);
    for(int i=0; i<n; i++) f[i] = 1ll * f[i] * g[i] % mod;
    fwt3(f, -1);
    for(int i=0; i<n; i++) printf("%d ", f[i]); 
}