zzun.net

[info.] 2004 여름 / 네트워크 프로그래밍(경북대) / 고석주 교수님 using : C / Linux / TCP/IP / Multi-threads / thread-synchronization(mutex) [Makefile] all : zchat_serv zchat_clnt zchat_serv : zchat_serv.c zchat.h gcc -o zchat_serv zchat_serv.c -D_REENTRANT -lpthread zchat_clnt : zchat_clnt.c zchat.h gcc -o zchat_clnt zchat_clnt.c -D_REENTRANT -lpthread [zchat.h] /** Z-Chat Header File zzun hello82@unitel.co.kr http:..

[info.] 2004 Summer / 네트워크 프로그래밍(경북대) / 고석주 교수님 [rspgame_serv.c] /** RSP game SERVER zzun hello82@unitel.co.kr http://zzun.net **/ #include #include #include #include #include #include #define BUFSIZE 5 void err_handler( char* msg ) { fputs( msg, stderr ); exit(1); } void z_handler( int sig ) // zombie child process handler { int rtn; waitpid( -1, &rtn, WNOHANG ); } int who_win( int a, int b ) /..

http://online-judge.uva.es/p/v4/453.html /** Intersecting Circles zzun http://zzun.net **/ #include #include #include float pow2( float a ) { return pow( a, 2 ); } int main() { ifstream fin; float a[2], b[2], r[2], x[2], y[2], temp; fin.open( "test.in" ); fin >> a[0] >> b[0] >> r[0] >> a[1] >> b[1] >> r[1]; while ( ! fin.eof() ) { float d = sqrt( pow2(a[0]-a[1]) + pow2(b[0]-b[1]) ); // distance ..

http://acm.uva.es/p/v1/143.html /** Orchard Trees zzun hello82@unitel.co.kr http://zzun.net **/ #include #include ifstream fin; void swap(float& a, float& b) { float temp = a; a = b; b = temp; } bool read_input(float* x, float* y) { bool rtn = false; for (int i=0; i> x[i] >> y[i]; if ( x[i] > 0 || y[i] > 0 ) rtn = true; } return rtn; } int main() { fin.open("test.in"); float* x = new float[3]; f..

[info] http://acm.uva.es/p/v1/108.html 내림피아드 프로젝트의 첫번째 문제 O(N^3) 알고리즘 [test.in] 4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 [n01_zzun.cpp] /** Max-Sum Subrectangle Search zzun http://zzun.net hello82@unitel.co.kr **/ #include #include #include #include int array_size; char** num_array; bool read_input(char* filename) { ifstream fin; int buf; fin.open( filename ); fin >> array_size; // take the arra..

[info] http://acm.uva.es/p/v1/108.html 내림피아드 프로젝트의 첫번째 문제 O(N^4) 알고리즘 [test.in] 4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 [n01_zzun.cpp] /** Max-Sum Subrectangle Search zzun http://zzun.net hello82@unitel.co.kr **/ #include #include #include #include int array_size; char** num_array; bool read_input(char* filename) { ifstream fin; int buf; fin.open( filename ); fin >> array_size; // take the arra..

2003 Fall / 화일처리 / 이석호 교수님 /** AVL Tree zzun hello82@unitel.co.kr http://zzun.net **/ #include struct node // AVL tree node { int data; // data type is integer struct node * left; // left subtree struct node * right; // right subtree int height; // height of the tree }; struct node * root = NULL; // root node, initially NULL void print_tree_level_order(struct node* tree, int length) // print tre..

2003 Fall / 컴퓨터 모델링 / 고건 교수님 /** myshell zzun hello82@unitel.co.kr http://zzun.net **/ #include void fork_and_exec(char* path, int block_parent) { int pid; pid = fork(); if (pid == 0) execlp(path, path, (char *)0); else if (pid>0 && block_parent==1) waitpid(pid, NULL, 0); } int main() { char buffer[5]; printf("$$"); while (scanf("%s", &buffer) != EOF) { if (!strcmp(buffer, "d")) fork_and_exec("/..

2003 Fall / 화일처리 / 이석호 교수님 /** Binary Search Tree zzun hello82@unitel.co.kr http://zzun.net **/ #include struct znode // binary search tree node { int data; // data type is integer struct znode * left; // left subtree struct znode * right; // right subtree }; struct znode * root = NULL; // root node, initially NULL void print_tree_inorder(struct znode* tree) // print tree in inorder (left -> par..

프로그래밍 언어 / 2003년 1학기 / 한상영 교수님 [입력파일 예시] A := B + C B := 3 C := 5 PRINT D PRINT A B := 8 PRINT A RESET PRINT A [calculator.scm] (define inport (open-input-file "calculator.in")) (define outport (open-output-file "calculator.out")) (define a ''undef) (define a-rec 0) (define b ''undef) (define b-rec 0) (define c ''undef) (define c-rec 0) (define d ''undef) (define d-rec 0) (define e ''undef) (def..