Skip to content

Commit

Permalink
Weekly Pull Request - 안세아 (#348)
Browse files Browse the repository at this point in the history
* feat(Seah-An):[programmers] 기능개발

https://programmers.co.kr/learn/courses/30/lessons/42586

* feat(Seah-An):[BOJ,2644] 촌수계산

https://www.acmicpc.net/problem/2644

* feat(Seah-An):[BOJ,2606]바이러스

https://www.acmicpc.net/problem/2606

* feat(Seah-An): [프로그래머스] 순위

https://programmers.co.kr/learn/courses/30/lessons/49191

* feat(Seah-An): [프로그래머스] 순위

https://programmers.co.kr/learn/courses/30/lessons/49191

* feat(Seah-An):[프로그래머스,힙] 더 맵게

https://programmers.co.kr/learn/courses/30/lessons/42626

* feat(Seah-An): [Book] selection_sort

책 예제 문제 풀이

* feat(Seah-An): [Book] palindrome1

* feat(Seah-An) : [Book] palindrome2

* feat(Seah-An) : [Book] linked-list

* feat(Seah-An):[Programmers]디스크 컨트롤러

https://programmers.co.kr/learn/courses/30/lessons/42627

* feat(Seah-An): [Book] Binary-Search

* feat(Seah-An):[programmers] 이중우선순위큐

https://programmers.co.kr/learn/courses/30/lessons/42628

* feat(Seah-An): [inflearn] K번째 약수

* feat(Seah-An): [inflearn]  K번째 수

* feat(Seah-An) : [inflearn] K번째 큰 수
  • Loading branch information
takoyummy committed Jul 10, 2021
1 parent 0cc3d36 commit 967b5f3
Show file tree
Hide file tree
Showing 3 changed files with 44 additions and 0 deletions.
13 changes: 13 additions & 0 deletions Seah-An/book/implementation/AA.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
import sys
# sys.stdin=open("input.txt","rt")
n, k = map(int, input().split())
arr = []
for i in range(1,n+1):
if n % i == 0:
arr.append(i)

if len(arr) < k:
print(-1)
else:
print(arr.pop(k-1))

17 changes: 17 additions & 0 deletions Seah-An/inflearn/implementation/K번째 큰 수.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
import sys
sys.stdin=open("in1.txt","rt")

N, K = map(int, input().split())

arr = list(map(int,input().split()))

count = 0
res = set()
for i in range(N):
for j in range(i+1,N):
for k in range(j+1, N):
res.add(arr[i] + arr[j] + arr[k])

res = list(res)
res.sort(reverse=True)
print(res[K-1])
14 changes: 14 additions & 0 deletions Seah-An/inflearn/implementation/K번째수.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
import sys

sys.stdin = open("input.txt", "rt")

# 테케
T = int(input())

for i in range(T):
N, s, e, k = map(int, input().split())

a = list(map(int,input().split()))
a = a[s-1:e]
a.sort()
print("#%d %d" %(i+1,a.pop(k-1)))

0 comments on commit 967b5f3

Please sign in to comment.