보통 직장인의 지식 생활

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=3239 JUNGOL www.jungol.co.kr #include //Segment Tree typedef long long LL; int N, M; const int TLM = 1 b ? b : a; else return a; } void init(int now, int s, int e) { minT[now] = N + 1; if (s >= e) return; int lch = now * 2, rch = lch + 1; int m = (s + e) / 2; init(lch, s, m); init(rch, m + 1, e); } void update(int now, int s, int e, int t..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2425&sca=99&sfl=wr_hit&stx=3143 JUNGOL www.jungol.co.kr #include enum { A, 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 }; struct nd { int num; nd* pWord; nd() : num(0), pWord(nullptr) {} ~nd() { if (pWord) for (int i = 0; i < MAX; i++) if (pWord[i].pWord) delete [] pWord[i].pWord; } } Root[MAX]; int TC,..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2419&sca=99&sfl=wr_hit&stx=3137 JUNGOL www.jungol.co.kr #include int T, N; char dial[10010][11]; int len[10010], trienum[11][11], bcnt; //'0'~'9' 그리고 10번째는 0(다음거 없는것) bool num2digit[11][2]; //0번: 2자리수 이상이 있는지, 1번: 1자리수가 있는지 int strlen(char* s, int len = 0) { while (s[len]) len++; return len; } int strncmp(char* s, char* t, int n) { while..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2418&sca=99&sfl=wr_hit&stx=3136 JUNGOL www.jungol.co.kr #include int N, M; typedef unsigned long long u64; u64 arr[1002][1002]; //(0,0) ~ (i,j) 까지의 합 int main(void) { scanf("%d", &N); u64 tmp; for (int i = 1; i

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2417&sca=99&sfl=wr_hit&stx=3135 JUNGOL www.jungol.co.kr #include int N, Arr[1000010], Q; long long sum[1000010]; void Input() { scanf("%d", &N); for (int i = 1; i

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2405&sca=99&sfl=wr_hit&stx=3123 JUNGOL www.jungol.co.kr #include int T; char Sent[1000010]; typedef struct Node { Node() : pPrev(nullptr), pNext(nullptr), c(0) {} Node* pPrev; Node* pNext; char c; }; Node Head, Tail, *pCursor; void Add(char c) { Node* pNew = new Node; Node* pOldPrev = pCursor->pPrev; pOldPrev->pNext = pNew; pNew->pPrev =..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2397&sca=99&sfl=wr_hit&stx=3115 JUNGOL www.jungol.co.kr #include char A[205], B[205], Ans[205]; char *pMax, *pMin; int MaxLen, MinLen, AnsLen; void clear(int* p, int len = 205) { for (int i = 0; i < len; i++) p[i] = 0; } int strlen(const char* s, int len = 0) { while (s[len]) len++; return len; } int strcmp(const char* s, const char* t) ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2375&sca=99&sfl=wr_hit&stx=3106 JUNGOL www.jungol.co.kr #include typedef unsigned long long int u64; u64 N, R; char iv[66]; int cnt, A, B; int bin[64]; char Hex[37] = { '0','1','2','3','4','5','6','7','8','9', 'A','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' }; bool input() { scanf..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=3101 JUNGOL www.jungol.co.kr #include struct Node { Node* pPrev; Node* pNext; int my; Node(int n) : pPrev(this), pNext(this), my(n) {} Node(Node* pp, Node* pn, int n) : pPrev(pp), pNext(pn), my(n) { pp->pNext = this; pn->pPrev = this; } }; int N, K; Node* pFirst; void Input() { scanf("%d %d", &N, &K); Node* pN = pFirst = new Node(1); for ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=2815 JUNGOL www.jungol.co.kr #include int N, cnt, R; int bin[32]; int main(void) { cnt = 31; scanf("%d", &N); while (N) { R = N % 2; N /= 2; bin[cnt--] = R; } for (int i = cnt + 1; i < 32; i++) { printf("%d", bin[i]); } return 0; }