보통 직장인의 지식 생활

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=942&sca=99&sfl=wr_hit&stx=1669 JUNGOL www.jungol.co.kr #include struct sausage { int len, wid, visited; } ssg[5010], tmp[5010]; int N, ans; void mergesort(int s, int e) { if (s >= e) return; int m = (s + e) / 2, k = s, a = s, b = m + 1; mergesort(s, m); mergesort(m + 1, e); while (a

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=931&sca=99&sfl=wr_hit&stx=1658 JUNGOL www.jungol.co.kr #include int get_gcd(int x, int y) { int i, ans = 0; for (i = 1; i

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=839&sca=99&sfl=wr_hit&stx=1566 JUNGOL www.jungol.co.kr #include enum Alphabet { A = 65, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, MAX }; char Sentc[10010]; int AlphaNum[MAX]; void Input() { scanf("%s", Sentc); } void FillNum() { for (int i = 0; Sentc[i] != 0; i++) AlphaNum[Sentc[i]]++; } bool IsPrimeNum(i..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=807&sca=99&sfl=wr_hit&stx=1535 JUNGOL www.jungol.co.kr #include struct Node { Node* pPrev, *pNext; int len; char* pWord; Node() : pPrev(nullptr), pNext(nullptr), len(0), pWord(nullptr) {} Node(Node* prev, Node* next) : pPrev(prev), pNext(next), len(0), pWord(nullptr) { prev->pNext = next->pPrev = this; } } H, T; char stc[55]; bool IsSame..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=806&sca=99&sfl=wr_hit&stx=1534 JUNGOL www.jungol.co.kr #include int N, C, Con[32], cnt, R; char Hex[16] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F' }; int main(void) { cnt = 31; scanf("%d %d", &N, &C); while (N) { R = N % C; N /= C; Con[cnt--] = R; } for (int i = cnt + 1; i < 32; i++) { printf("%c", Hex[Con[i]]);..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=788&sca=99&sfl=wr_hit&stx=1516 JUNGOL www.jungol.co.kr #include char stc[205]; struct Node { Node* pPrev; Node* pNext; int len, cnt; char* pWord; Node() : pPrev(nullptr), pNext(nullptr), len(0), cnt(0), pWord(nullptr) {} Node(Node* prev, Node* next) : pPrev(prev), pNext(next), len(0), cnt(1), pWord(nullptr) { next->pPrev = prev->pNext = ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=734&sca=99&sfl=wr_hit&stx=1462 JUNGOL www.jungol.co.kr #include int R, C, dr[4] = { 1, -1, 0, 0 }, dc[4] = { 0 , 0, 1, -1 }, chkmap[55][55], s, e, maxDist; char map[55][55]; //W는 바다, L은 땅, M은 시작점을 해봤던 땅 struct P { int r, c, hour; } que[10000]; void enque(int r, int c, int dist) { que[e].r = r, que[e].c = c, que[e++].hour = dist; chkmap[r..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=729&sca=99&sfl=wr_hit&stx=1457 JUNGOL www.jungol.co.kr #include int R, C, K, grid[110][110], cnt, area[2550], area2[2550], s, e; struct Point { int r, c; } buf[50000]; Point delta[4] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1} }; void push_back(int r, int c) { buf[e].r = r; buf[e++].c = c; } Point& pop() { return buf[s++]; } int BFS(int r, int ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1419&sca=99 JUNGOL www.jungol.co.kr #include /* 0001 0010 0011 0100 0101 0110 0111 1000 (Big Endian) 1 2 3 45 6 7 8 0111 1000 0101 0110 0011 0100 0001 0010 (Little Endian) 7 8 5 63 4 1 2 8비트씩 끊어서 표현함 */ /* Horner's method ara 12040 1204 1240 1402 04021 while (a) { ra = ra * 10 + a % 10; a /= 10; } */ typedef unsigned int u32; u32 input, o..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=687&sca=99&sfl=wr_hit&stx=1411 JUNGOL www.jungol.co.kr #include /* 한 번 수학적 귀납법으로 구해보면 F(1) = 1 F(2) = 3 F(3) = 5 F(4) = 11 F(N) = F(N-1) + 2*F(N-2) */ const int SUB = 20100529; int N, F[100100]; int main(void) { F[1] = 1, F[2] = 3; scanf("%d", &N); for (int i = 3; i