← All problemsSign in

The Faulty Tree

CodeChefRating 3262Open on judge ↗

Alice and Bob will play a game on an array $A$, consisting of $N$ numbers. The rules of the games are: - Alice and Bob will construct a binary tree of exactly $N$ leaves. - Each node of the tree is given a value: - If the node is a leaf, its value will be one of the unused array's elements. - Else, the node's value will be the sum of its two children. - The ugliness of the tree is defined

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start