보통 직장인의 지식 생활

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

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=649&sca=99&sfl=wr_hit&stx=1374 JUNGOL www.jungol.co.kr #include char A[205], B[205], add[205]; char* pB, * pS; int alen, blen, biglen, smalllen, bgidx; int strlen(const char* s, int len = 0) { while (s[len]) len++; return len; } int strcmp(const char* s, const char* t) { while (*s && *s == *t) s++, t++; return *s - *t; } void strcpy(char..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=632&sca=99&sfl=wr_hit&stx=1357 JUNGOL www.jungol.co.kr /* 합이0 hash version : chaining a + b + c + d = 0 을 a + b = -(c + d) 로 바꾸어 해결, 숫자가 크므로, 전부 하지 않고, 해시하여 상위 24비트만 계산함으로써 100%가 아니라 99.99%로 기대한다. */ #include typedef unsigned int UI; typedef long long LL; const int LM = 4000; const int SIZE = 1 next) { if (p->key == key) return p; //똑같은 ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=614&sca=99&sfl=wr_hit&stx=1335 JUNGOL www.jungol.co.kr #include enum { WHITE = 0, BLUE, CMAX }; int N, M[130][130], Ccnt[CMAX]; void Count(int sr, int sc, int er, int ec) { int color = M[sr][sc], pass = 1; for (int i = sr; i

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1332&sca=99 JUNGOL www.jungol.co.kr #include const int LM = 400100; char str[LM]; int len, fail[LM], ans[LM], alen; //0에서 idx까지의 접두사=접미사인 최대 길이 int strlen(char* s, int len = 0) { while (s[len]) len++; return len; } void preKMP() { //fail 배열 채우기 for (int i = 2, prelen = 0; i = 0; i--) printf("%d ", ans[i]); printf("\n"); return 0; }

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=589&sca=99&sfl=wr_hit&stx=1309 JUNGOL www.jungol.co.kr #include typedef unsigned long long u64; int N; u64 ans = 1; int main() { scanf("%d", &N); while (N) { if (N == 1) printf("1! = 1\n"); else printf("%d! = %d * %d!\n", N, N, N - 1); ans *= N--; } printf("%lld\n", ans); return 0; }