Consecutive Xor Codechef Starters 73 (Rated till 6-Stars) problem solution

This post is all about the solution of the Consecutive Xor Codechef Starters 73 (Rated till 6-Stars) problem solution.

Codechef

Problem Statement:

Chef has a NN-length array AA. On AA, he can perform the following operation:

1) Choose an index ii (1 le I le N - 1)(1iN1) and an integer XX X) and A i + 1:= (A i + 1 oplus X)A X). (oplus denotes the bitwise XOR operation here.)

Determine whether Chef can make all of the elements of AA equal by repeating the above operation an unlimited number of times (possibly zero).

Format of Input :

The number of cases will be indicated by a single integer TT in the first line of input.

Each test case's first and only line includes 2 space-separated integers NN and MM — the number of apples and oranges, respectively.

Format of the Output :

For every test case, output YES if the group is perfect and NO or else on a new line.

Each character can be printed in either uppercase or lowercase. The strings YES, yes, Yes, and yES, for example, are all considered identical.

Also Check this out:-

Chef Plays Ludo Codechef Starters 73 (Rated till 6-Stars) problem solution, Click Here

Multivitamin Tablets Codechef Starters 73 (Rated till 6-Stars) problem solution, Click Here

Lucky Numbers Codechef Starters 73 (Rated till 6-Stars) problem solution, Click Here

Append for OR Codechef Starters 73 (Rated till 6-Stars) problem solution, Click Here

Consecutive Xor Codechef Starters 73 (Rated till 6-Stars) problem solution, Click Here

New Upcoming OnePlus 11 Specifications, Click Here

Solution of the Problem: Click Here

Consecutive Xor Codechef Starters 73 (Rated till 6-Stars) problem solution