보통 직장인의 지식 생활

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; }

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=578&sca=99&sfl=wr_hit&stx=1295 JUNGOL www.jungol.co.kr #include int N, A[50010], T; int BinSrch(int s, int e, int val) { int m = (s + e) / 2; //printf("[val=%d] s: %d, m: %d, e: %d\n", val, s, m, e); if (A[m] == val) return m; else if (s >= e) return 0; else if (A[m] > val)return BinSrch(s, m, val); elsereturn BinSrch(m + 1, e, val); } i..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1274&sca=99 JUNGOL www.jungol.co.kr #include int N[8], minus = 1, dec; int main(void) { int j = 1; for (int i = 0; i = 0; i--) { N[i] = (N[i] == 0 ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1264&sca=99 JUNGOL www.jungol.co.kr #include int X, Y, N; enum { W = 0, B, }; struct P { int x, y; }; struct CP { P s, e; int color; }; CP Que[100000]; int sp, MaxArea, MinArea = 40000 * 40000; void push_back(CP c) { Que[sp++] = c; } int Get(int myx, int myy) { for (int i = 0; i = e.x ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1262&sca=99 JUNGOL www.jungol.co.kr #include char A[105], B[105], ans[205]; 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* dest, const char* src) { while ((*dest++ = *src++)); } int input() { for (i..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1240&sca=99 JUNGOL www.jungol.co.kr #include typedef unsigned long long u64; u64 N; //Binary Search u64 bsearch(u64 s, u64 e, u64 target) { u64 ans = target, mid; while (s