Numbers with Strength
CodeChefOpen on judge ↗
One of the events at Quark'23 is a programming competition that challenges participants to solve a problem involving an array of numbers and their "strength". The strength of a number is defined as the maximum integer $x$ such that $2^x$ divides that number leaving no remainder. For example, the strength of 12 is 2 because it can be divided by 2 twice to get 3. The participants are given a total
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.
Sign in to chat with the tutor and save your progress.
Sign in to start