Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2), problem: (D) Varying Kibibits Solution In C/C++

By |2017-07-24T01:33:02+00:00July 24th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , , |

#include <bits/stdc++.h> #define MAXN (1000000) #define MAXM (6) #define mod (1000000007) #define ll long long int n; int a[MAXN], b[MAXN], c[MAXN], g[MAXN], pow10[MAXM + 2]; void FWT(int *a, int length, int len){ for(int i = 1; i <= len; ++ i){ for(int j = [...]