2024-08-10

tgyuuAn/README.md

@@ -74,4 +74,5 @@
 | 65차시 | 2024.07.19 |  최소 공통 조상  | <a href="https://www.acmicpc.net/problem/3584">가장 가까운 공통 조상</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/220
 | 66차시 | 2024.07.22 |  DP  | <a href="https://www.acmicpc.net/problem/2169">로봇 조종하기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/222
 | 67차시 | 2024.07.26 |  DP  | <a href="https://www.acmicpc.net/problem/3687">성냥개비</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/223
+| 69차시 | 2024.08.10 |  누적합, 수학  | <a href="https://www.acmicpc.net/problem/9527">1의 개수 세기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/228
 ---

tgyuuAn/누적합/1의 개수 세기.py

@@ -0,0 +1,22 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+A, B = map(int, input().split())
+
+bits = [0 for _ in range(len(bin(B)[2:]))]
+
+for step in range(len(bits)):
+    one_count_per_bundle = (2**step)
+    total_count_bundle = 2 * (one_count_per_bundle)
+
+    B_d, B_m = divmod(B,total_count_bundle)
+    B_count = one_count_per_bundle * B_d
+    if(B_m >= one_count_per_bundle): B_count += min(one_count_per_bundle,(B_m - one_count_per_bundle + 1))
+
+    A_d, A_m = divmod(A-1,total_count_bundle)
+    A_count = one_count_per_bundle * A_d
+    if(A_m >= one_count_per_bundle): A_count += min(one_count_per_bundle, (A_m - one_count_per_bundle + 1))
+    bits[step] += (B_count - A_count)
+
+print(sum(bits))