Skip to content

[Sony] BOJ algorithm 10989 #71

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
honux77 merged 1 commit into from
Jun 15, 2019
Merged

[Sony] BOJ algorithm 10989 #71

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
17 changes: 17 additions & 0 deletions 190613/sony/boj_10989.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
import sys

n = int(sys.stdin.readline())


def countingSort(n):
count_list = [0] * (10001) # 주어지는 수의 크기 범위만큼 리스트 길이를 만든다.
for _ in range(n):
a = int(sys.stdin.readline())
count_list[a] += 1

for j in range(len(count_list)):
if count_list[j] != 0:
for _ in range(count_list[j]):
print(j)

countingSort(n)