๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

2110

Algorithm/๋ฐฑ์ค€ [๋ฐฑ์ค€] #2110 ๊ณต์œ ๊ธฐ ์„ค์น˜ (Python) 1. ๋ฌธ์ œ ์„ค๋ช… ๋ฌธ์ œ ๋งํฌ input : ์ฒซ์งธ ์ค„ : ์ง‘์˜ ๊ฐœ์ˆ˜ N, ๊ณต์œ ๊ธฐ์˜ ๊ฐœ์ˆ˜ C ๋‘˜์งธ ์ค„๋ถ€ํ„ฐ N๊ฐœ์˜ ์ค„: ์ง‘์˜ ์ขŒํ‘œ return : ์ฒซ์งธ ์ค„์— ๊ฐ€์žฅ ์ธ์ ‘ํ•œ ๋‘ ๊ณต์œ ๊ธฐ ์‚ฌ์ด์˜ ์ตœ๋Œ€ ๊ฑฐ๋ฆฌ 2. ์ฝ”๋“œ import sys input = sys.stdin.readline #์ง€์ •ํ•œ ๊ฑฐ๋ฆฌ๋ฅผ ๊ธฐ์ค€์œผ๋กœ, ๊ณต์œ ๊ธฐ๋ฅผ ๋ช‡๊ฐœ ์„ค์น˜ํ•  ์ˆ˜ ์žˆ๋Š”์ง€ N, C = map(int, (input().split()))#์ง‘, ๊ณต์œ ๊ธฐ ๊ฐฏ์ˆ˜ house = [int(input()) for _ in range(N)] #์ง‘ ์ขŒํ‘œ house = sorted(house) #์ด๋ถ„ํƒ์ƒ‰์„ ์œ„ํ•œ ์ •๋ ฌ def router_counter(distance): count = 1 cur_house = house[0] #์‹œ์ž‘์  for i in range(1, N):..

ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”