일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 | 29 |
30 | 31 |
- 파이썬
- Java
- Lv. 0
- 프로그래머스
- Lv. 1
- javascript
- 오블완
- join
- dfs
- 소프티어
- 티스토리챌린지
- Lv. 3
- Dynamic Programming
- programmers
- Python
- level 3
- group by
- LEVEL 2
- select
- 자바스크립트
- 너비 우선 탐색
- SQL
- softeer
- Baekjoon
- SQL 고득점 KIT
- Lv. 2
- DP
- bfs
- 백준
- 깊이 우선 탐색
- Today
- Total
목록알고리즘/풀었지만 다시 보기 (37)
몸과 마음이 건전한 SW 개발자

문제 링크https://www.acmicpc.net/problem/10830정답 코드import sysinput = sys.stdin.readlinen, b = map(int, input().split())matrix = [list(map(int, input().split())) for _ in range(n)]optimization = dict()# matrix의 원소가 1000이하이기 때문에 처음부터 걸러준다.for i in range(n): for j in range(n): matrix[i][j] %= 1000optimization[1] = matrix# cal = calculationdef cal(leftM, rightM): newM = [[0] * n for _ in ra..

문제 링크https://www.acmicpc.net/problem/15684내 코드import sysinput = sys.stdin.readlinen, m, h = map(int, input().split())board = [[0] * (n+1) for _ in range(h+1)]for _ in range(m): row, column = map(int, input().split()) board[row][column] = column + 1 board[row][column+1] = columndef check(board, destination): c = destination for r in range(1, h+1): if board[r][c]: ..

문제 링크https://www.codetree.ai/trails/complete/curated-cards/challenge-group-same-word/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai정답 코드import sysinput = sys.stdin.readlinen = int(input())words = ..

문제 링크https://www.codetree.ai/trails/complete/curated-cards/challenge-the-sum-of-the-elements-is-0/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai내 코드n = int(input())A = list(map(int, input().split(..

문제 링크https://www.codetree.ai/trails/complete/curated-cards/challenge-sum-of-three-num/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai내 코드n, k = map(int, input().split())arr = list(map(int, input()...

문제 링크https://www.acmicpc.net/problem/1504정답 코드import sysimport heapqinput = sys.stdin.readlinen, e = map(int, input().split())adjL = [[] for _ in range(n+1)]for _ in range(e): start, to, dist = map(int, input().split()) adjL[start].append([to, dist]) adjL[to].append([start, dist])v1, v2 = map(int, input().split())# 1에서 v1 까지 최소 + N에서 v2 까지 최소 + v1 v2 까지 최소# 1에서 v2 까지 최소 + N에서 v1 까지 최소 +..