daily plan <18 nov 6> 12:00 ~ 14:00 spa14:00 ~ 16:30 system software hw219:00 ~ 22:00 system software hw2 | mid2(구간나누기) It's a long time to do handray by peda in 64bit unix system. * News/일상 2018.11.06
daily plan <18 nov 5> 10:30 ~ 11:30 mid2 구간나누기 x16:30 ~ 18:00 mid2 자두나무 x19:00 ~ 22:00 system software hw2 // system software hw2 절반 (due 11.08) * News/일상 2018.11.05
baekjun 행렬의 곱셈순서 D[i][j] = min(D[i][k] + D[k+1][j] + m[i][0] * m[i][1] * m[j][1]) if i > N; memset(cache, -1, sizeof(cache)); for(int i=1; i > matrix[i][0] >> matrix[i][1]; } cout * Computer Science/Algorithm 2018.11.02
baekjun coin1, coin2 a[i] += a[i - coin[j]] : 경우의수a[i] = a[i - coin[j]] + 1 : 최소 동전수 1234567891011121314151617181920212223242526272829#include using namespace std; int coins[101];int d[10001];int main(){ int N, M; cin >> N >> M; for(int i = 1; i > coins[i]; } for(int i = 0; i * Computer Science/Algorithm 2018.11.02
daily plan <18 nov 2> 09:00 ~ 12:00 coin2, pal214:00 ~ 16:00 system software HW2-install winscp, peda gdb, bomb solution16:00 ~ 18:00 mid2file combine19:00 ~ 22:00 mid2multrix 목표 : ~구간나누기 * News/일상 2018.11.02
Descent Recursive parser with attribute implematation for compiler HW6 보호되어 있는 글입니다. * Computer Science/compiler 2018.11.01
understanding Pointers & arrays #3 Decl An *An **An Cmp Bad Size int A[3][5] Y N 60 Y N 20 Y N 4 int *A2[3][5] Y N 120 Y N 40 Y N 8 int (*A3)[4][5] Y N 8 Y Y(공간 할당이 안되어있을 수 있기에) 60 Y Y 20 int *(A4[3][5]) Y N 120 Y N 40 y N 8 int (*A5[3])[5] Y N 24 Y N 8 Y Y 20 ***An은 selfstudy * News/Tech 2018.11.01
c++ list splice iterator로 지정된 구간을 첫 파라미터의 위치로 옮기는 작업 12345678910111213#include using namespace std; int main(){ list LLa = { 114, 115, 116, 117, 119, 120, 130, 140, 150 } ; list ::iterator it1, it2; it1 = LLa.begin() ; it1++ ; it1++ ; it1++ ; it1++ ; it2 = it1; it2++; it2++; it2++; LLa.splice(LLa.end(), LLa, it1, it2) ; return 0;} Colored by Color Scriptercs * Computer Science/C++ 2018.11.01