문제풀이/구현

https://www.acmicpc.net/problem/8972코드r, c = map(int, input().split())map_data = [list(input()) for _ in range(r)]movings = list(map(int, list(input())))dirs = [(0, 0), (1, -1), (1, 0), (1, 1), (0, -1), (0, 0), (0, 1), (-1, -1), (-1, 0), (-1, 1)]def manhatan_distance(x1, y1, x2, y2): return abs(x1-x2)+abs(y1-y2)def solution(r, c, map_data, movings): js = [] crazys = [] for i i..
https://softeer.ai/practice/11002코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())cptis = dict()for _ in range(n): input_cpti = int(input(), 2) if input_cpti in cptis: cptis[input_cpti] += 1 else: cptis[input_cpti] = 1answer = 0for num in cptis.keys(): answer += (cptis[num]*(cptis[num]-1))//2 # 1개 다른 사람 세기 for i in range(m): new_num = n..
https://www.acmicpc.net/problem/15683코드answer = 64n, m = map(int, input().split())office = []cctv = []blank = 0for i in range(n): line = list(map(int, input().split())) for j in range(m): if line[j] != 0 and line[j] != 6: cctv.append([i, j, line[j]]) elif line[j] == 0: blank += 1 office.append(line)dx = [-1, 0, 1, 0]dy = [0, 1, 0, -1]# cctv 종류에 따라서 이동..
https://school.programmers.co.kr/learn/courses/30/lessons/17677?language=javascript코드function isAlpha(str) { return /^[A-Za-z]+$/.test(str);}function getFragment(str) { const result = []; for (let i = 0; i { const cnt1 = str1Fragments.filter((value) => value === frag).length; const cnt2 = str2Fragments.filter((value) => value === frag).length; union += Math.max(cnt1, cnt2); inter..
https://www.acmicpc.net/problem/16960 코드from collections import defaultdictn, m = map(int, input().split())lamp_count = defaultdict(int)switch_lamp = []for _ in range(n): num, *arr = list(map(int, input().split())) switch_lamp.append(arr) for a in arr: lamp_count[a] += 1for i in range(n): possible = True for lamp in switch_lamp[i]: if lamp_count[lamp] == 1: ..
딜레이레이
'문제풀이/구현' 카테고리의 글 목록