Skip to content

Commit 7465766

Browse files
Merge pull request #610 from baekhangyeol/main
[백한결] 88차 라이브 코테 제출
2 parents 3732c2d + 43156c6 commit 7465766

3 files changed

Lines changed: 48 additions & 0 deletions

File tree

live8/test88/문제1/백한결.py

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
def solution(sequence, k):
2+
answer = [0, 0]
3+
sum = 0
4+
min = 1000000000
5+
6+
left = 0
7+
8+
for right in range(len(sequence)):
9+
sum += sequence[right]
10+
11+
while sum > k and right >= left:
12+
sum -= sequence[left]
13+
left += 1
14+
15+
if sum == k:
16+
if right - left < min:
17+
min = right - left
18+
answer = [left, right]
19+
20+
return answer

live8/test88/문제2/백한결.py

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
import sys
2+
3+
4+
def main():
5+
N, M = map(int, sys.stdin.readline().split())
6+
7+
A = list(map(int, sys.stdin.readline().split()))
8+
B = list(map(int, sys.stdin.readline().split()))
9+
10+
result = sorted(A + B)
11+
12+
print(' '.join(map(str, result)))
13+
14+
15+
if __name__ == '__main__':
16+
main()

live8/test88/문제3/백한결.py

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
def solution(n, lost, reserve):
2+
3+
reserve_set = set(reserve) - set(lost)
4+
lost_set = set(lost) - set(reserve)
5+
6+
for i in sorted(reserve_set):
7+
if i - 1 in lost_set:
8+
lost_set.remove(i- 1)
9+
elif i + 1 in lost_set:
10+
lost_set.remove(i + 1)
11+
12+
return n - len(lost_set)

0 commit comments

Comments
 (0)