:: ADVANCE ::
BAEKJOON ONLINE JUDGE 11375 열혈강호 https://www.acmicpc.net/problem/11375 열혈강호 시리즈 1 네트워크 플로우 중 이분 매칭 문제 1. C1234567891011121314151617181920212223242526272829303132333435363738394041424344454647#include int person[1001][1001];int visit[1001];int work[1001]; int bmatch(int p){ int i, w; if (visit[p]) return 0; visit[p] = 1; for (i = 1; i
BAEKJOON ONLINE JUDGE 1085 직사각형에서 탈출 https://www.acmicpc.net/problem/1085 123456789101112131415161718192021222324#include int min(int first, int second){ if (first
BAEKJOON ONLINE JUDGE 1063 킹 https://www.acmicpc.net/problem/1063 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614..