Merge pull request #260 from AlgoLeadMe/36-H0ngJu

36-H0ngJu

H0ngJu/README.md

@@ -37,3 +37,4 @@
 | 33차시 | 2024.11.08 | 백트래킹  | [병원 거리 최소화](https://www.codetree.ai/training-field/frequent-problems/problems/min-of-hospital-distance/submissions?page=11&pageSize=5) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/253 |
 | 34차시 | 2024.11.19 |  누적합   |                                               [개똥벌레](https://www.acmicpc.net/problem/3020)                                                | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/256 |
 | 35차시 | 2024.11.23 |    DP     |                                                [전깃줄](https://www.acmicpc.net/problem/2565)                                                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/258 |
+| 36차시 | 2024.12.02 |   수학    |                                               [머리 톡톡](https://www.acmicpc.net/problem/1241)                                               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/260 |

H0ngJu/수학/머리 톡톡.py

@@ -0,0 +1,21 @@
+import sys
+
+def input() : return sys.stdin.readline().rstrip()
+
+N = int(input())
+students = [int(input()) for _ in range(N)]
+hits = [0 for _ in range(1000001)]
+results = [0 for _ in range(N)]
+
+for student in students:
+    hits[student] += 1
+
+for idx in range(len(students)):
+    for i in range(1, int(students[idx]**(1/2)) + 1):
+        if students[idx] % i == 0:
+            results[idx] += hits[i]
+            if (i ** 2) != students[idx]:
+                results[idx] +=  hits[students[idx] // i]
+
+for r in results:
+    print(r-1, end=" ")