Solution

In a lively car showroom, an array of cars awaits, each with its distinctive features. Picture yourself mixing and matching these cars in unique
combinations to create dream blends which have an F-score equal to the XOR value of the combination.

Your mission: To compute the blend score, which is the XOR of the F-score values for all these dreamy combinations.

Now, it's time to r eveal the grand total!

Input Format:

- The first line of input consists of the integer N, representing the number of cars in the showroom.
- The second line consists of N integers, representing the features of the car.

Output Format:
Print the sum of F-scores obtained.

Constraints:
1 <= N <= 10^4
0 <= Fi <= 10^4

Sample Testcase 0:
Testcase Input: Show More

Solution

Rahul has an integer array called 'arr' of length N containing unique values. He wants to create a balanced tree where each parent node has
smaller valued nodes on its left and larger valued nodes on its right. This balanced tree should ensure that the depth of the two subtrees for every
node doesn't differ by more than one.

Your task is to assist him in creating this type of tree .

The output contains N lines denoting the pre-order traversal of nodes. If the left child of the node contains a non-null value, then print the value;
otherwise, print a dot (.). A similar process for the right child also. Each right child value is separated from the node by a ">" sign, and each left
child by a left arrow sign.

Input Format:

- First line contains an integer N representing the size of the array arr.
- The second line contains N unique space-separated integers representing the elements of the array arr.

Output Format:

The output contains N lines denoting the pre-order traversal of nodes. If the left child of the node contains a non-null value, then print the value;
otherwise, print a dot (.). A similar process for the right child also. Each right child value is separated from the node by a "-" sign, and each left child
by a left arrow sign.

Constraints:
1 <= N <= 10^5
1 <= arr[i] <= 10^19 Show More

Problem Statement

You have a budget of x coins each day to buy beer, and your goal is to buy as many bottles of beer as possible before the price of beer in all shops exceeds your daily budget.
There are N shops, and each shop sells one bottle of beer per day. The price of beer in each shop increases by 1 coin per day after each purchase.
You can visit multiple shops in a single day, but you can buy only one bottle per shop per day.

Your task is to determine the total number of beer bottles you can buy before the prices at all shops exceed your daily budget.

Input Format

The first line contains two space-separated integers N, X. The number of shops and everyday budget.
The second line contains N space-separated integers, representing the cost of one bottle in each shop.

Output Format
Print one integer representing the total number of beer bottles you can buy before prices exceed your daily budget. Show More