Count Set Cost

Bit Manipulation Contest Easy

Given two integers n and k, return the cost of flipping all set bits in n. One flip operation costs k.

Constraints

0 <= n < 2³¹
0 <= k <= 10⁴

Company Tags

[ ]

Code

Login to Run Code

✅ Testcase

Input: {'k': '10', 'n': '9'}

Expected:
20

Actual: -

Time: - sec

Status: Waiting