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

๐Ÿ‡ฆ๐Ÿ‡ฑ๐Ÿ‡ฌ๐Ÿ‡ด๐Ÿ‡ท๐Ÿ‡ฎ๐Ÿ‡น๐Ÿ‡ญ๐Ÿ‡ฒ

[์ด์ฝ”ํ…Œ] ๊ตฌํ˜„
๐Ÿ‡ฆ๐Ÿ‡ฑ๐Ÿ‡ฌ๐Ÿ‡ด๐Ÿ‡ท๐Ÿ‡ฎ๐Ÿ‡น๐Ÿ‡ญ๐Ÿ‡ฒ 2023. 2. 28. [์ด์ฝ”ํ…Œ] ๊ตฌํ˜„ ์ฐธ๊ณ ์ž๋ฃŒ: ์ด๊ฒƒ์ด ์ฝ”๋”ฉ ํ…Œ์ŠคํŠธ๋‹ค with ํŒŒ์ด์ฌ ๊ตฌํ˜„ ๋จธ๋ฆฟ์†์— ์žˆ๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์†Œ์Šค ์ฝ”๋“œ๋กœ ๋ฐ”๊พธ๋Š” ๊ณผ์ • problem - thinking - solution ์˜ˆ์ œ 1 - ์ƒํ•˜์ขŒ์šฐ ์—ฌํ–‰๊ฐ€ A๋Š” N x N ํฌ๊ธฐ์˜ ์ •์‚ฌ๊ฐํ˜• ๊ณต๊ฐ„ ์œ„์— ์„œ ์žˆ๋‹ค. ์ด ๊ณต๊ฐ„์€ 1 x 1 ํฌ๊ธฐ์˜ ์ •์‚ฌ๊ฐํ˜•์œผ๋กœ ๋‚˜๋ˆ„์–ด์ ธ์žˆ๋‹ค. ๊ฐ€์žฅ ์™ผ์ชฝ ์œ„ ์ขŒํ‘œ๋Š” (1,1) ์ด๋ฉฐ, ๊ฐ€์žฅ ์˜ค๋ฅธ์ชฝ ์•„๋ž˜ ์ขŒํ‘œ๋Š” (N,N)์— ํ•ด๋‹นํ•œ๋‹ค. ์—ฌํ–‰๊ฐ€ A๋Š” ์ƒ, ํ•˜, ์ขŒ, ์šฐ ๋ฐฉํ–ฅ์œผ๋กœ ์ด๋™ํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ์‹œ์ž‘ ์ขŒํ‘œ๋Š” ํ•ญ์ƒ (1,1)์ด๋‹ค. ์šฐ๋ฆฌ ์•ž์—๋Š” ์—ฌํ–‰๊ฐ€ A๊ฐ€ ์ด๋™ํ•  ๊ณ„ํš์ด ์ ํžŒ ๊ณ„ํš์„œ๊ฐ€ ๋†“์—ฌ ์žˆ๋‹ค. ๋‹ค์Œ์€ N = 5์ธ ์ง€๋„์™€ ๊ณ„ํš์„œ R → R → R → U → D → D (1,1) (1,2) (1,3) (1,4) (1,5) (2,1) (2,2) (2,3) (2,4)..
[์ด์ฝ”ํ…Œ] ๊ทธ๋ฆฌ๋””(Greedy)
๐Ÿ‡ฆ๐Ÿ‡ฑ๐Ÿ‡ฌ๐Ÿ‡ด๐Ÿ‡ท๐Ÿ‡ฎ๐Ÿ‡น๐Ÿ‡ญ๐Ÿ‡ฒ 2023. 2. 9. [์ด์ฝ”ํ…Œ] ๊ทธ๋ฆฌ๋””(Greedy) ์ฐธ๊ณ ์ž๋ฃŒ: ์ด๊ฒƒ์ด ์ฝ”๋”ฉ ํ…Œ์ŠคํŠธ๋‹ค with ํŒŒ์ด์ฌ ๊ทธ๋ฆฌ๋”” (Greedy) ๐Ÿ’ก ํ˜„์žฌ ์ƒํ™ฉ์—์„œ ์ง€๊ธˆ ๋‹น์žฅ ์ข‹์€ ๊ฒƒ๋งŒ ๊ณ ๋ฅด๋Š” ๋ฐฉ๋ฒ• → ํƒ์š•๋ฒ• ์˜ˆ์ œ - ๊ฑฐ์Šค๋ฆ„๋ˆ n = 1260 count = 0 coin_types = [500,100,50,10] for coin in coin_types: count += n // coin n %= coin print(count) โœ” ๊ฐ€์žฅ ํฐ ํ™”ํ ๋‹จ์œ„๋ถ€ํ„ฐ ๋ˆ์„ ๊ฑฐ์Šฌ๋Ÿฌ ์ฃผ๋Š” ๊ฒƒ ํฐ ์ˆ˜์˜ ๋ฒ•์น™ n, m, k = map(int, input().split()) data = list(map(int, input().split())) data.sort() first = data[n-1] second = data[n-2] result = 0 while True: for i in range(k)..

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