Github & Portfolio
๐ Problem Solving(119)
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv2] ๊ฑฐ๋ฆฌ๋๊ธฐ ํ์ธํ๊ธฐ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๊ฑฐ๋ฆฌ๋๊ธฐ ํ์ธํ๊ธฐ [["POOOP", "OXXOX", "OPXPX", "OOXOX", "POXXP"], ["POOPX", "OXPXP", "PXXXO", "OXXXO", "OOOPP"], ["PXOPX", "OXOXP", "OXPOX", "OXXOP", "PXPOX"], ["OOOXX", "XOOOX", "OOOXX", "OXOOX", "OOOOO"], ["PXPXP", "XPXPX", "PXPXP", "XPXPX", "PXPXP"]] [1, 0, 1, 1, 1] programmers.co.kr from collections import deque dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(i, j, length, element): q = deq..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv1] ์ซ์ ๋ฌธ์์ด๊ณผ ์๋จ์ด / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ซ์ ๋ฌธ์์ด๊ณผ ์๋จ์ด ๋ค์ค์ ํ๋ก๋๊ฐ ์ซ์๋์ด๋ฅผ ํ๊ณ ์์ต๋๋ค. ๋ค์ค๊ฐ ํ๋ก๋์๊ฒ ์ซ์๋ฅผ ๊ฑด๋ฌ ๋ ์ผ๋ถ ์๋ฆฟ์๋ฅผ ์๋จ์ด๋ก ๋ฐ๊พผ ์นด๋๋ฅผ ๊ฑด๋ค์ฃผ๋ฉด ํ๋ก๋๋ ์๋ ์ซ์๋ฅผ ์ฐพ๋ ๊ฒ์์ ๋๋ค. ๋ค์์ ์ซ์์ ์ผ๋ถ ์ programmers.co.kr alpha = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] def solution(s): start = 0 end = 1 answer = "" while start < len(s): if s[start].isdigit(): answer += s[start] start = end end += 1 continue if s[start:end] in alpha..
-
[๋ฐฑ์ค-14497] ์ฃผ๋์ ๋(้ฃ) / Python
https://www.acmicpc.net/problem/14497 14497๋ฒ: ์ฃผ๋์ ๋(้ฃ) ์ฃผ๋์ด๋ ํฌ๊ฒ ํ๊ฐ ๋ฌ๋ค. ์ฑ ์ ์๋ ์์ ๋ชฐ๋ ๋จน์ผ๋ ค๊ณ ์จ๊ฒจ๋ ์ด์ฝ๋ฐ๊ฐ ์ฌ๋ผ์ก๊ธฐ ๋๋ฌธ์ด๋ค. ์ฃผ๋์ด๋ ๋ฏธ์ณ ๋ ๋ฐ๊ธฐ ์์ํ๋ค. ์ฌ์ค, ์ง์ง๋ก ๋ฐ๊ธฐ ์์ํ๋ค. ‘์ฟต... ์ฟต...’ ์ฃผ๋์ด๋ ์ ํ์ ํ www.acmicpc.net import sys from collections import deque input = sys.stdin.readline n, m = map(int, input().split()) x1, y1, x2, y2 = map(int, input().split()) graph = [] for _ in range(n): graph.append(list(map(str, input().rstrip()..
-
[๋ฐฑ์ค-5972] ํ๋ฐฐ ๋ฐฐ์ก / Python
5972๋ฒ: ํ๋ฐฐ ๋ฐฐ์ก ๋๋ถ ํ์๋ ๋๋ถ ์ฐฌํ์ด์๊ฒ ํ๋ฐฐ๋ฅผ ๋ฐฐ๋ฌํด์ค์ผ ํฉ๋๋ค. ๊ทธ๋ฆฌ๊ณ ์ง๊ธ, ๊ฐ ์ค๋น๋ฅผ ํ๊ณ ์์ต๋๋ค. ํํ๋กญ๊ฒ ๊ฐ๋ ค๋ฉด ๊ฐ๋ ๊ธธ์ ๋ง๋๋ ๋ชจ๋ ์๋ค์๊ฒ ๋ง์๋ ์ฌ๋ฌผ์ ์ค์ผ ํฉ๋๋ค. ๋ฌผ๋ก ํ์๋ www.acmicpc.net import sys import heapq input = sys.stdin.readline INF = int(1e9) n, m = map(int, input().split()) graph = [[] for _ in range(n + 1)] distance = [INF] * (n + 1) for _ in range(m): a, b, c = map(int, input().split()) graph[a].append((b, c)) graph[b].append((a, c)) d..
-
[๋ฐฑ์ค-18405] ๊ฒฝ์์ ์ ์ผ / Python
18405๋ฒ: ๊ฒฝ์์ ์ ์ผ ์ฒซ์งธ ์ค์ ์์ฐ์ N, K๊ฐ ๊ณต๋ฐฑ์ ๊ธฐ์ค์ผ๋ก ๊ตฌ๋ถ๋์ด ์ฃผ์ด์ง๋ค. (1 ≤ N ≤ 200, 1 ≤ K ≤ 1,000) ๋์งธ ์ค๋ถํฐ N๊ฐ์ ์ค์ ๊ฑธ์ณ์ ์ํ๊ด์ ์ ๋ณด๊ฐ ์ฃผ์ด์ง๋ค. ๊ฐ ํ์ N๊ฐ์ ์์๋ก ๊ตฌ์ฑ๋๋ฉฐ, ํด๋น ์์น www.acmicpc.net import sys from collections import deque input = sys.stdin.readline n, k = map(int, input().split()) graph = [] for _ in range(n): graph.append(list(map(int, input().split()))) s, x, y = map(int, input().split()) queue = [] for i in range(n): f..
-
[๋ฐฑ์ค-6118] ์จ๋ฐ๊ผญ์ง / Python
6118๋ฒ: ์จ๋ฐ๊ผญ์ง ์ฌ์๊ธฐ๋ ์ํ๋์ ๊ต์ธ ๋์ฅ์์ ์จ๋ฐ๊ผญ์ง์ ํ๊ณ ์๋ค. ๋์ฅ์๋ ํ๊ฐ์ด ๋ง์ด ๋๋ ค์๊ณ ์ฌ์๊ธฐ๋ ๊ทธ ์ค์ ํ๋์ ์จ์ด์ผ ํ๋ค. ํ๊ฐ์ ๊ฐ์๋ N(2