์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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
- ์ฌ๊ท
- bfs
- ๋ค์ต์คํธ๋ผ
- 3์ฐจ์๋ฐฐ์ด
- ํ๋ก์ด๋์์ฌ
- ๋ฌธ์์ด
- ์ด๋ถํ์
- ๊ตฌํ
- ๋ถํ ์ ๋ณต
- DP
- ์ ๋ ฌ
- ์๋๋ก์ด๋
- Python
- ๋ฐฑํธ๋ํน
- ๋นํธ๋ง์คํน
- ํ์ด์ฌ
- SQL
- heapq
- BOJ
- Deque
- HashMap
- ์กฐํฉ
- ํ๋ก๊ทธ๋๋จธ์ค
- ๋ธ๋ฃจํธํฌ์ค
- dfs
- ์๊ณ ๋ฆฌ์ฆ
- ๋ถ๋ถ์งํฉ
- Today
- Total
๋ชฉ๋ก๋ค์ต์คํธ๋ผ (3)
It's easy, if you try
๋ฌธ์ https://programmers.co.kr/learn/courses/30/lessons/49189 ์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๊ฐ์ฅ ๋จผ ๋ ธ๋ 6 [[3, 6], [4, 3], [3, 2], [1, 3], [1, 2], [2, 4], [5, 2]] 3 programmers.co.kr ํ์ด import java.util.*; import java.io.*; class Solution { static ArrayList[] minEdges; static int[] dirs; static boolean[] visited; static int maxNum = 0; private static class Node implements Comparable { int no; // ๋ ธ๋ ๋ฒํธ int dir; // ๊ฑฐ๋ฆฌ Nod..
๋ฌธ์ 14938๋ฒ: ์๊ฐ๊ทธ๋ผ์ด๋ ์์์ด๋ ์์ฆ ๊ฐ์ฅ ์ธ๊ธฐ๊ฐ ์๋ ๊ฒ์ ์๊ฐ๊ทธ๋ผ์ด๋๋ฅผ ์ฆ๊ธฐ๊ณ ์๋ค. ์๊ฐ๊ทธ๋ผ์ด๋๋ ์ฌ๋ฌ ์ง์ญ์ค ํ๋์ ์ง์ญ์ ๋ํ์ฐ์ ํ๊ณ ๋ํํ์ฌ, ๊ทธ ์ง์ญ์ ๋จ์ด์ ธ ์๋ ์์ดํ ๋ค์ ์ด์ฉํด ์๋ฐ์ด๋ฒ์ www.acmicpc.net ์ ์ฒด์ฝ๋ import java.util.*; import java.io.*; public class Main { static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); static StringTokenizer st; static ArrayList[] graph; static int[] distance; static boolean[] check; static int[] item..
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Arrays; import java.util.StringTokenizer; /* 5 0 2 2 5 9 2 0 3 4 8 2 3 0 7 6 5 4 7 0 5 9 8 6 5 0 ==> 8 4 0 94 53 16 79 0 24 18 91 80 0 98 26 51 92 0 ==> 16 7 0 2 8 5 9 15 20 2 0 5 4 7 10 16 8 5 0 7 6 4 10 5 4 7 0 15 8 9 9 7 6 15 0 11 13 15 10 4 8 11 0 6 20 16 ..