1052 - 물병 (비트마스킹, 그리디)

Author: zeesouth

README.md

@@ -183,6 +183,7 @@
 - <a href="https://www.acmicpc.net/problem/2258">2258. 정육점</a>
 - <a href="https://www.acmicpc.net/problem/2513">2513. 통학버스</a>
 - <a href="https://www.acmicpc.net/problem/18768">18768. 팀 배정</a>
+- <a href="https://www.acmicpc.net/problem/1052">1052. 물병</a>
 </pre>
 </div>
 </details>

src/greedy/n1052/Main.java

@@ -0,0 +1,21 @@
+package greedy.n1052;
+
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int N = sc.nextInt();
+        int K = sc.nextInt();
+
+        int ans = 0;
+
+        // Integer.bitCount(정수): 주어진 정수에서 true의 bit 개수를 찾는 함수
+        while (Integer.bitCount(N) > K) {
+            ans += N & (-N);
+            N += N & (-N);
+        }
+
+        System.out.println(ans);
+    }
+}