[Solved] Chef and Professor codechef solution

Chef and Professor codechef solution Chef’s professor gave him homework to find a permutation of length 2N2N such that each integer from 00 to 2N−12N−1 appears exactly once in the permutation and the maximum bitwise XOR of any even length subarray is minimized. Chef wonders how many such permutations are there. Help Chef to find out the number of permutations modulo (109+7)(109+7), satisfying the above conditions and also …

[Solved] Chef and Professor codechef solution Read More »