Skip to content

heapqを使っていたので、ソートされていなかった #39

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 31, 2025
Merged

heapqを使っていたので、ソートされていなかった #39

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 3 additions & 5 deletions libs/math_func.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -69,8 +69,6 @@ def calc_divisors(N):
計算量は、√Nです
約数は昇順に並んでいます
"""
import heapq

result = []

for i in range(1, N + 1):
Expand All @@ -80,11 +78,11 @@ def calc_divisors(N):
if N % i != 0:
continue

heapq.heappush(result, i)
result.append(i)
if N // i != i:
heapq.heappush(result, N // i)
result.append(N // i)

return result
return sorted(result)


def factorization(n):
Expand Down