[Coding Round 796 Div 2] Patchouli's Magical Talisman [Easy Greedy Problem]

00:00 Problem Description 01:00 Intro 01:06 Explanation 06:06 Code 10:10 Submit Tutorial to solve the Patchouli's Magical Talisman , whose objective is to determine the minimum number of operations to make all the numbers odd. This is a greedy problem that can be solved by looking at some properties: *All odd numbers have the most right bit on which is the position of the 1 in binary representation *Adding any number with an odd number gives an odd number Feel free to comment!