first draft of xor conv

Author: lrvideckis

library/convolution/xor_convolution.hpp

@@ -0,0 +1,21 @@
+#pragma once
+#include "../math/mod_division.hpp"
+void fwht(int n, vi& a) {
+  for (int i = 1; i != n; i <<= 1)
+    for (int j = 0; j != n; j += i << 1)
+      for (int k = 0; k != i; k++) {
+        int x = a[j + k], y = a[i + j + k];
+        a[j + k] = (x + y) % mod;
+        a[i + j + k] = (x - y + mod) % mod;
+      }
+}
+vi xor_conv(vi& a, vi& b) {
+  int n = sz(a), inv = mod_div(1, n);
+  fwht(n, a);
+  fwht(n, b);
+  vi res(n);
+  rep(i, 0, n) res[i] = 1LL * a[i] * b[i] % mod;
+  fwht(n, res);
+  rep(i, 0, n) res[i] = 1LL * res[i] * inv % mod;
+  return res;
+}

tests/library_checker_aizu_tests/convolution/xor_convolution.test.cpp

@@ -0,0 +1,19 @@
+#define PROBLEM \
+  "https://judge.yosupo.jp/problem/bitwise_xor_convolution"
+#include "../template.hpp"
+#include "../../../library/convolution/xor_convolution.hpp"
+istream& operator>>(istream& is, vector<int>& v) {
+  for (int i = 0; i < sz(v); i++) is >> v[i];
+  return is;
+}
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n;
+  cin >> n;
+  vi a(1 << n), b(1 << n);
+  cin >> a >> b;
+  vi c = xor_conv(a, b);
+  for (int i = 0; i < (1 << n); i++) cout << c[i] << ' ';
+  cout << '\n';
+  return 0;
+}