Computer Science, asked by likkitv2000, 1 month ago

Problem Statement
You are given three integers N, M and X. You want to calculate the number of arrays A
of size N, that satisfy the following conditions:
• The sum of elements of the array is equal to M, I. e A1 + A2 + A3 + .. + An = M
The bitwise xor of the elements of the array is equal to X, i.e A1^ ^Az^Az
= X. Here ^ denotes bitwise xor operation.
л
AAN
Since the answer can be very large return it modulo 109 +7.
Input Format
The first line contains an integer, N, denoting the number of elements in an array
The next line contains an integer, M, denoting the sum of elements in an array
The next line contains an integer, X, denoting the bitwise-xor of the elements in an
array​

Answers

Answered by aayushkumar987186319
0

Answer:

good afternoon I love you and I will be sorry

Similar questions