test/xor_convolution.test.cpp

• View this file on GitHub
• Last update: 2021-10-22 20:41:06+09:00
• Problem: https://judge.yosupo.jp/problem/bitwise_xor_convolution

Depends on

• atcoder/internal_math.hpp
• atcoder/internal_type_traits.hpp
• atcoder/kronecker_power_transform.hpp
• atcoder/modint.hpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_xor_convolution"

#include <atcoder/modint>
#include <atcoder/kronecker_power_transform>
#include <iostream>
#include <vector>

using namespace atcoder;
using namespace std;

int main() {
    int n; cin >> n;
    using mint = modint998244353;
    std::vector<mint> a(1<<n), b(1<<n);
    for (int i = 0; i < 1<<n; i++) {
        int x; cin >> x; a[i] = x;
    }
    for (int i = 0; i < 1<<n; i++) {
        int x; cin >> x; b[i] = x;
    }
    xor_convolution(a, b);
    for (int i = 0; i < 1<<n; i++) {
        cout << a[i].val() << ' ';
    }
    cout << '\n';
}

#line 1 "test/xor_convolution.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_xor_convolution"

#include <atcoder/modint>
#include <atcoder/kronecker_power_transform>
#include <iostream>
#include <vector>

using namespace atcoder;
using namespace std;

int main() {
    int n; cin >> n;
    using mint = modint998244353;
    std::vector<mint> a(1<<n), b(1<<n);
    for (int i = 0; i < 1<<n; i++) {
        int x; cin >> x; a[i] = x;
    }
    for (int i = 0; i < 1<<n; i++) {
        int x; cin >> x; b[i] = x;
    }
    xor_convolution(a, b);
    for (int i = 0; i < 1<<n; i++) {
        cout << a[i].val() << ' ';
    }
    cout << '\n';
}

Back to top page