:: 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..

BAEKJOON ONLINE JUDGE 1049 기타줄 https://www.acmicpc.net/problem/1049 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include #define Min(x, y) (((x)

BAEKJOON ONLINE JUDGE 12758 천상용섬 https://www.acmicpc.net/problem/12758 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576#include #include #include #include using namespace std; #define MOD 1000000007 int dp[310][300];vector mnt[310];int n; void input(){ int i, j; int num; scanf("%d", &n); for (i = 1; i

BAEKJOON ONLINE JUDGE 12852 1로 만들기 2 https://www.acmicpc.net/problem/12852 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162#include #include #include int dp[1000001];int output[1000001]; int solve(int n){ int min = 2147000000; int temp, out; if (dp[n] != -1) return dp[n]; if (n % 3 == 0) { temp = solve(n / 3); if (temp

BAEKJOON ONLINE JUDGE 13199 치킨 먹고 싶다 https://www.acmicpc.net/problem/13199 문제 열자마자 일단 당황...ㅋㅋㅋㅋ 12345678910111213141516171819202122232425262728293031#include int chicken, money, f, c; int main(){ int nCount; int doyung, sangun, docnt, sangcnt; scanf("%d", &nCount); while (nCount--) { scanf("%d %d %d %d", &chicken, &money, &f, &c); doyung = docnt = sangun = money / chicken; docnt = sangcnt = docn..

BAEKJOON ONLINE JUDGE 1225 이상한 곱셈 https://www.acmicpc.net/problem/1225 123456789101112131415161718192021#include char first[10001], second[10001]; int main(){ int i, j; long long int ans = 0; scanf("%s %s", first, second); for (i = 0; first[i] != '\0'; i++) { for (j = 0; second[j] != '\0'; j++) { ans += (first[i] - '0') * (second[j] - '0'); } } printf("%lld\n", ans); return 0;}Colored by Color S..

BAEKJOON ONLINE JUDGE 11565 바이너리 게임 https://www.acmicpc.net/problem/11565 1234567891011121314151617181920212223242526272829#include char str[1001]; int main(){ int i; int a = 0, b = 0; scanf("%s", str); for (i = 0; str[i] != '\0'; i++) { if(str[i] == '1') a++; } str[0] = '\0'; scanf("%s", str); for (i = 0; str[i] != '\0'; i++) { if (str[i] == '1') b++; } if (a % 2) a++; if (a >= b) printf("VICTO..

BAEKJOON ONLINE JUDGE 1213 팰린드롬 만들기 https://www.acmicpc.net/problem/1213 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include char input[55];int alpha[26];int right[55]; int main(){ int cnt = 0; int i, j; int center = -1; scanf("%s", input); for (i = 0; input[i] != '\0'; i++) { alpha[input[i] - 'A']++; } for (i = 0; i = 2) { printf("I'm Sorry Hansoo..