[Link] https://www.acmicpc.net/problem/2638 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include...
BOJ. Two-Dimenstion Array And Operation (17140)
[Link] https://www.acmicpc.net/problem/17140 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #includ...
BOJ. CCW (11758)
[Link] https://www.acmicpc.net/problem/11758 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #includ...
BOJ. Tree Investment (16235)
[Link] https://www.acmicpc.net/problem/16235 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #includ...
BOJ. Four Numbers Of With Sum (7453)
[Link] https://www.acmicpc.net/problem/7453 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include...
BOJ. Lecture Room Assignment (11000)
[Link] https://www.acmicpc.net/problem/11000 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #includ...
BOJ. N th Biggest Number (2075)
[Link] https://www.acmicpc.net/problem/2075 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include...
LeetCode. 1028. Recover a Tree From Preorder Traversal
[Link] https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/ #include <bits/stdc++.h> /** * Definition for a binary tree node. * struct TreeNode { * int val; * ...
BOJ. Race (2517)
[Link] https://www.acmicpc.net/problem/2517 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include...
BOJ. Candy Box (2243)
[Link] https://www.acmicpc.net/problem/2243 #include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include...