| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- String
- two pointer
- Stored Procedure
- Two Points
- Dijkstra
- binary search
- DP
- 이진탐색
- 스토어드 프로시저
- 그래프
- MYSQL
- Trie
- 다익스트라
- SQL
- Hash
- union find
- Brute Force
- Today
- Total
목록전체 글 (425)
codingfarm
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091//https://www.acmicpc.net/problem/1197 #include#include#include using namespace std; class Edge {public: int from, to, weight; Edge(int from_, int to_, int weight_) : from(from_), to(to_), weight(weight_) {} Edge() : Edge(-1,..
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960#include#include using namespace std; vector union_set;vector union_level; int UnionFind(int index) { if (union_set[index] != -1) { union_set[index] = UnionFind(union_set[index]); return union_set[index]; } else return index;} void UnionMerge(int a, int b) { a = UnionFind(a); b = UnionF..
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556#include using namespace std; class Node {public: int key, value;}; Node tmp[100]; void MergeSort(Node* arr, int start, int end) { if (start >= end) return; int mid = (end - start) / 2 + start; MergeSort(arr, start, mid); MergeSort(arr, mid + 1, end); //PartSort(arr, start, end, mid); int i = s..
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150#include using namespace std; class ListNode {public: in..