πŸ’» Dev & CSSystem & Embedded

μ‹œμŠ€ν…œ ν”„λ‘œκ·Έλž˜λ° ν”„λ‘œμ νŠΈ #1

Problem: Input File: [sample.txt 0.00MB](https://blog.kakaocdn.net/dna/WEEud/btqA6oyqdRE/AAAAAAAAAAAAAAAAAAAAAF6o8u7LK5SB9AIdNSz_-IRJgLPtbZjLxGCM5EIoOvqI/sample.txt?credential=yqXZFxpELC7KVnFOS48ylbz2pIh7yKj8&expires=1788188399&allow_ip=&allow_referer=&signature=AakSu1DOyqICwWZkF6%2F%2FvvgPYME%3D&attach=1&knm=tfile.txt) Execution Result: μ†ŒμŠ€ Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 #include <stdio.h> #include <string.h> #include <stdlib.h> void main() { FILE *fp; char buf[80]; int n = 0; if ((fp = fopen("sample.s", "r")) == NULL) { fprintf(stderr, "file not found...\n"); exit(1); } while(fgets(buf, sizeof(buf), fp) != NULL) { n += get_token_num(buf); } fclose(fp); printf("Number of token = %d\n", n); } int get_token_num(char *bp) { char *cp; int n = 0; for(cp = strtok(bp, " \t\n"); cp != NULL; ) { n++; cp = strtok(NULL, " \t\n"); } return(n); } Explanation: ...

January 12, 2020 Β· 1 min Β· Sobamemil
πŸ’» Dev & CSSystem & Embedded

μ‹œμŠ€ν…œ ν”„λ‘œκ·Έλž˜λ° ν”„λ‘œμ νŠΈ #2

Problem: Input File: [sample.txt 0.00MB](https://blog.kakaocdn.net/dna/I5Kf9/btqA7q3zbiX/AAAAAAAAAAAAAAAAAAAAANrvSUHPXY9pb861NzszU1ZSjedb5bh_Z-XW6gY7gY7Q/sample.txt?credential=yqXZFxpELC7KVnFOS48ylbz2pIh7yKj8&expires=1788188399&allow_ip=&allow_referer=&signature=Z3BB1PLUPoQ6gz717fxkZL1UeNg%3D&attach=1&knm=tfile.txt) Execution Result: μ†ŒμŠ€ Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 #include <stdio.h> #include <string.h> #include <stdlib.h> void get_token_num(char *bp, int *num, int *alpha, int *other) { char *cp; int i, count1, count2; for(cp = strtok(bp, " \t\n"); cp != NULL;){ if('A' <= cp[0] && 'Z' >= cp[0]) count1 = -1; else if('0' <= cp[0] && '9' >= cp[0]) count1 = 0; else{ count1 = 1; count2 = 1; break; } int len = strlen(cp); for(i=0; i<len; i++){ if ( 'A' <= cp[i] && 'Z' >= cp[i]) count2 = -1; else if ( '0' <= cp[i] && '9' >= cp[i]) count2 = 0; else count2 = 1; if(count2 != count1){ count2 = 1; break; } } switch(count2) { case -1 : *alpha += 1; break; case 0 : *num += 1; break; case 1 : *other += 1; break; default : fprintf(stderr,"error...\n"); exit(2); } cp = strtok(NULL," \t\n"); } } int main(){ FILE *fp; char buf[80]; int num = 0, alpha=0, other=0; if((fp = fopen("sample.s", "r")) == NULL){ fprintf(stderr, "file not found...\n"); exit(1); } while(fgets(buf, sizeof(buf), fp) != NULL){ get_token_num(buf, &num, &alpha, &other); } fclose(fp); printf("Number = %d\n", num); printf("Alphabet = %d\n", alpha); printf("Other = %d\n", other); return 0; } Explanation: ...

January 12, 2020 Β· 2 min Β· Sobamemil
πŸ’» Dev & CSSystem & Embedded

μ‹œμŠ€ν…œ ν”„λ‘œκ·Έλž˜λ° ν”„λ‘œμ νŠΈ #3

Problem: Input File: [sample.txt 0.00MB](https://blog.kakaocdn.net/dna/45Fiq/btqA5PcbiZG/AAAAAAAAAAAAAAAAAAAAAKYSkI0QPrzP-9mNerqdA2M0Tul-f5_nfn5HKLp50AXV/sample.txt?credential=yqXZFxpELC7KVnFOS48ylbz2pIh7yKj8&expires=1788188399&allow_ip=&allow_referer=&signature=zgVylyi4wQaArIqnlrxSbRC1hSk%3D&attach=1&knm=tfile.txt) Execution Result: μ†ŒμŠ€ Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 #include <stdio.h> #include <string.h> #include <stdlib.h> char sym[50][10], inst[50][10], op[50][10]; int symcnt, instcnt, opcnt= 0; void get_token_num(char *bp); void main() { FILE *fp; char buf[80]; int num = 0; int i; if ((fp = fopen("sample.s", "r")) == NULL) { fprintf(stderr, "file not found...\n"); exit(1); } while(fgets(buf, sizeof(buf), fp) != NULL) { get_token_num(buf); } fclose(fp); printf("심볼 10μΉΈμ”© 좜λ ₯ :\n\n"); for(i=0; i<symcnt; i++){ if(num<10){ printf("%s\t", sym[i]); num++; } else if(num==10){ printf("\n"); num=0; i -= 1; } } num = 0; printf("\nλͺ…λ Ήμ–΄ 10μΉΈμ”© 좜λ ₯ :\n\n"); for(i=0; i<instcnt; i++){ if(num<10){ printf("%s\t", inst[i]); num++; } else if(num==10){ printf("\n"); num=0; i -= 1; } } printf("\n\nν”Όμ—°μ‚°μž 10μΉΈμ”© 좜λ ₯ :\n\n"); num = 0; for(i=0; i<opcnt; i++){ if(num<10){ printf("%s\t", op[i]); num++; } else if(num==10){ printf("\n"); num=0; i -= 1; } } printf("\n\n"); } void get_token_num(char *bp){ char *cp; char *test; int n = 0; char* result = strtok(bp," \t\n"); while(result!=NULL) { while(1){ if(n<4){ switch (n){ case 0 : n++; break; case 1 : strcpy(sym[symcnt], result); symcnt++; n++; break; case 2 : strcpy(inst[instcnt], result); instcnt++; n++; break; case 3 : strcpy(op[opcnt], result); opcnt++; n++; break; } } else n=0; break; } result = strtok(NULL,"\t\n"); } } Explanation: ...

January 12, 2020 Β· 2 min Β· Sobamemil
πŸ’» Dev & CSSystem & Embedded

μ‹œμŠ€ν…œ ν”„λ‘œκ·Έλž˜λ° ν”„λ‘œμ νŠΈ #4

Problem: Input File: [numb.txt 0.00MB](https://blog.kakaocdn.net/dna/EqJyk/btqA57RastK/AAAAAAAAAAAAAAAAAAAAAMzaoxsjOizEuGCR5qF4Fzsa0iAquIjz6f_89H3gPle-/numb.txt?credential=yqXZFxpELC7KVnFOS48ylbz2pIh7yKj8&expires=1788188399&allow_ip=&allow_referer=&signature=wyxmqU%2F2ZPAkscVFgGfrU1oKVrU%3D&attach=1&knm=tfile.txt) Execution Result: μ†ŒμŠ€ Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 #include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> void get_token_num(char *bp); void hextodec(char *test, int len); // hex to decimal function void atohex(char *ascii, int len); // ascii to hex function int sum = 0; int cnt = 0; int main() { FILE *fp = NULL; char buf[80]; if((fp = fopen("numb.s", "r"))==NULL) { printf("file not found...\n"); exit(1); } while(fgets(buf, sizeof(buf), fp) != NULL) { get_token_num(buf); } fclose(fp); printf("\nsum = %d\n", sum); return 0; } void get_token_num(char *bp){ int i,len; char test[10]; char* result = strtok(bp," \t\n"); // λ¬Έμžμ—΄ 자λ₯΄κΈ° while(result!=NULL) { // 자λ₯Έ token이 NULL μΌλ–„κΉŒμ§€ loop if(result[0] == 'X'){ // 자λ₯Έ token 의 μ›μ†Œκ°€ 'X' 이면 hexadecimal for(i=2; i<=strlen(result)-2; i++){ // μ²˜λ¦¬ν•  λΆ€λΆ„λ§Œ μž˜λΌλƒ„ test[i-2] = result[i]; cnt++; } printf("token : %s\t",result); printf("\t\t"); hextodec(test, cnt); cnt=0; } else if(result[0] == 'C'){ // 자λ₯Έ token의 첫 μ›μ†Œκ°€ 'C' 이면 ASCII printf("token : %s\t",result); for(i=2; i<=strlen(result)-2; i++){ // μ²˜λ¦¬ν•  λΆ€λΆ„λ§Œ μž˜λΌλƒ„ test[i-2] = result[i]; cnt++; } test[cnt] = '\0'; atohex(test, cnt); cnt=0; } else { // 자λ₯Έ token이 λ¬Έμžμ—΄ μƒμˆ˜μ΄λ©΄ decimal printf("token : %s\t",result); sum += atoi(result); printf("\t\tdec : %d\n", atoi(result)); } result = strtok(NULL," \t\n"); } } void hextodec(char *test, int len){ // 16μ§„μˆ˜λ‘œ 된 λ¬Έμžμ—΄ int decimal = 0; // 10μ§„μˆ˜λ₯Ό μ €μž₯ν•  λ³€μˆ˜ int i; int position = 0; for (i = len - 1; i >= 0; i--) { // λ¬Έμžμ—΄μ„ μ—­μˆœμœΌλ‘œ 반볡 char ch = test[i]; // 각 μžλ¦Ώμˆ˜μ— ν•΄λ‹Ήν•˜λŠ” 문자λ₯Ό μ–»μŒ if (ch >= 48 && ch <= 57) { // λ¬Έμžκ°€ 09이면(ASCII μ½”λ“œ 4857) // λ¬Έμžμ—μ„œ 0에 ν•΄λ‹Ήν•˜λŠ” ASCII μ½”λ“œ 값을 λΉΌκ³  // 16에 자릿수λ₯Ό κ±°λ“­μ œκ³±ν•œ 값을 곱함 decimal += (ch - 48) * pow(16, position); } else if (ch >= 65 && ch <= 70) { // λ¬Έμžκ°€ AF이면(ASCII μ½”λ“œ 6570) // λŒ€λ¬Έμžλ‘œ 된 16μ§„μˆ˜μ˜ 처리 // λ¬Έμžμ—μ„œ (A에 ν•΄λ‹Ήν•˜λŠ” ASCII μ½”λ“œ κ°’ - 10)을 λΉΌκ³  // 16에 자릿수λ₯Ό κ±°λ“­μ œκ³±ν•œ 값을 곱함 decimal += (ch - (65 - 10)) * pow(16, position); } else if (ch >= 97 && ch <= 102) { // λ¬Έμžκ°€ af이면(ASCII μ½”λ“œ 97102) // μ†Œλ¬Έμžλ‘œ 된 16μ§„μˆ˜μ˜ 처리 // λ¬Έμžμ—μ„œ (a에 ν•΄λ‹Ήν•˜λŠ” ASCII μ½”λ“œ κ°’ - 10)을 λΉΌκ³  // 16에 자릿수λ₯Ό κ±°λ“­μ œκ³±ν•œ 값을 곱함 decimal += (ch - (97 - 10)) * pow(16, position); } position++; } printf("dec : %d\n", decimal); sum += decimal; } void atohex(char *ascii, int len){ char outword[10]; int i, tmp_len; for(i = 0; i<len; i++){ sprintf(outword+i*2, "%02X", ascii[i]); } tmp_len = strlen(outword); printf("hex : %s\t", outword); hextodec(outword, tmp_len); } Explanation: ...

December 19, 2019 Β· 4 min Β· Sobamemil
πŸ’» Dev & CSC++ Programming

C++ Programming Ch.9 Exercise 10 Solution

Problem: κ°„λ‹¨ν•œ κ·Έλž˜ν”½ νŽΈμ§‘κΈ°λ₯Ό μ½˜μ†” λ°”νƒ•μœΌλ‘œ λ§Œλ“€μ–΄λ³΄μž. κ·Έλž˜ν”½ νŽΈμ§‘κΈ°μ˜ κΈ°λŠ₯은 "μ‚½μž…", "μ‚­μ œ", "λͺ¨λ‘λ³΄κΈ°", "μ’…λ£Œ" 의 4가지이고, μ‹€ν–‰ 과정은 λ‹€μŒκ³Ό κ°™λ‹€. Objective & Hints: 좔상 클래슀, 상속 μ’…ν•© μ‘μš© Shapeκ³Ό 이λ₯Ό 상속받은 Circle, Line,Rect ν΄λž˜μŠ€λŠ” [κ·Έλ¦Ό9-13]을 μ΄μš©ν•˜κ³  ν•„μš”ν•œ ν΄λž˜μŠ€μ™€ main() ν•¨μˆ˜λ₯Ό μž‘μ„±ν•˜λΌ. 전체 ν”„λ‘œκ·Έλž¨μ€ λŒ€λž΅ μ•„λž˜μ™€ 같이 κ΅¬μ„±λœλ‹€. Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 #include #include<stdlib.h> using namespace std; class UI { public: static int show_menu() { int num; cout << "μ‚½μž…:1, μ‚­μ œ:2, λͺ¨λ‘λ³΄κΈ°:3, μ’…λ£Œ:4 >>" ; cin >> num; return num; } static int input_shape() { int num; cout << "μ„ :1, 원:2, μ‚¬κ°ν˜•:3 >> "; cin >> num; return num; } static int del_index() { int num; cout << "μ‚­μ œν•˜κ³ μž ν•˜λŠ” λ„ν˜•μ˜ 인덱슀 >> "; cin >> num; return num; } }; class Shape { // Node Shape* next; protected: virtual void draw() { cout << "--Shape--" << endl; } public: Shape() { next = NULL; } virtual ~Shape() {} Shape* add(Shape* p) { this->next = p; return p; } Shape* getNext() { return next; } void paint() { draw(); } void setNext(Shape *p) { this->next = p->next; } }; class Line : public Shape { public: virtual void draw() { cout << "Line" << endl; } }; class Circle : public Shape { public: virtual void draw() { cout << "Circle" << endl; } }; class Rect : public Shape { public: virtual void draw() { cout << "Rectangle" << endl; } }; class GraphicEditor { // List int node_size; Shape* pStart; Shape* pLast; public: GraphicEditor() { pStart = NULL; node_size = 0; } int run() { cout << "κ·Έλž˜ν”½ μ—λ””ν„°μž…λ‹ˆλ‹€.\n"; while(true){ int num; num = UI::show_menu(); switch (num){ case 1:{ num = UI::input_shape(); input_new(num); break; } case 2:{ if(pStart == NULL){ cout << "List Empty\n"; break; } num = UI::del_index(); del(num); break; } case 3:{ show(); break; } case 4:{ exit(0); } default : cout << "메뉴λ₯Ό 잘λͺ» μ„ νƒν•˜μ…¨μŠ΅λ‹ˆλ‹€.\n"; } } } void input_new(int n) { switch (n){ case 1: { if(node_size == 0) { pStart = new Line(); pLast = pStart; } else pLast = pLast->add(new Line()); node_size++; break; } case 2: { if(node_size == 0){ pStart = new Circle(); pLast = pStart; } else pLast = pLast->add(new Circle()); node_size++; break; } case 3: { if(node_size == 0){ pStart = new Rect(); pLast = pStart; } else pLast = pLast->add(new Rect()); node_size++; break; } default : cout << "메뉴λ₯Ό 잘λͺ» μ„ νƒν•˜μ…¨μŠ΅λ‹ˆλ‹€.\n"; } } bool del(int n) { int k=0; Shape* target_node = pStart; Shape* priv_node; if(n == 0){ pStart = pStart->getNext(); delete target_node; } else{ while( (target_node != NULL) && (k < n)){ priv_node = target_node; target_node = target_node->getNext(); k++; } if(target_node == NULL){ cout << "μ—†λŠ” λ…Έλ“œμž…λ‹ˆλ‹€.\n"; return false; } else { priv_node->setNext(target_node); delete target_node; } } node_size--; } void show() { Shape* p = pStart; int i=0; if(p == NULL) cout << "List Empty\n"; else while(p != NULL){ cout << i << ": "; p->paint(); p = p->getNext(); i++; } } }; int main() { GraphicEditor* g_editor = new GraphicEditor; g_editor->run(); delete g_editor; } Explanation: ...

November 26, 2019 Β· 4 min Β· Sobamemil
πŸ’» Dev & CSC++ Programming

C++ Programming Ch.9 Exercise 9 Solution

Problem: λ‹€μŒ κ·Έλ¦Όκ³Ό 같은 상속 ꡬ쑰λ₯Ό κ°–λŠ” 클래슀λ₯Ό μ„€κ³„ν•œλ‹€. λͺ¨λ“  ν”„λ¦°ν„°λŠ” λͺ¨λΈλͺ…(model), μ œμ‘°μ‚¬(manufacturer), 인쇄 맀수(printedCount), 인쇄 쒅이 μž”λŸ‰(availableCount)을 λ‚˜νƒ€λ‚΄λŠ” 정보λ₯Ό κ°€μ§„λ‹€. print(int pages) ν•¨μˆ˜μ™€ show() ν•¨μˆ˜λŠ” 가상 ν•¨μˆ˜λ‘œ κ΅¬ν˜„ν•˜λΌ. print(int pages)λŠ” pages 만큼 ν”„λ¦°νŠΈν•˜λŠ” ν•¨μˆ˜μ΄κ³ , show() ν•¨μˆ˜λŠ” ν˜„μž¬ ν”„λ¦°νŠΈμ˜ λͺ¨λΈ, μ œμ‘°μ‚¬, 인쇄 맀수, 인쇄 쒅이 μž”λŸ‰ 등을 좜λ ₯ν•˜λŠ” ν•¨μˆ˜μ΄λ‹€. μž‰ν¬μ ― ν”„λ¦°ν„°λŠ” μž‰ν¬ μž”λŸ‰(availableInk) 정보λ₯Ό μΆ”κ°€μ μœΌλ‘œ κ°€μ§€λ©°, λ ˆμ΄μ € ν”„λ¦°ν„°λŠ” ν† λ„ˆ μž”λŸ‰(availableToner) 정보λ₯Ό μΆ”κ°€μ μœΌλ‘œ κ°€μ§„λ‹€. μ΄λ“€μ˜ print(int pages) 멀버 ν•¨μˆ˜λŠ” ν”„λ¦°ν„° νƒ€μž…μ— 맞게 κ΅¬ν˜„ν•˜λΌ. 각 클래슀λ₯Ό 섀계 κ΅¬ν˜„ν•˜κ³  λ‹€μŒκ³Ό 같이 μ‹€ν–‰λ˜λ„λ‘ 전체 ν”„λ‘œκ·Έλž¨μ„ μ™„μ„±ν•˜λΌ. InkJetPrinter 객체와 LaserPrinter 객체λ₯Ό 각각 ν•˜λ‚˜λ§Œ λ™μ μœΌλ‘œ μƒμ„±ν•˜μ—¬ μ‹œμž‘ν•œλ‹€. ...

November 26, 2019 Β· 3 min Β· Sobamemil
πŸ’» Dev & CSSystem & Embedded

μ‹œμŠ€ν…œ ν”„λ‘œκ·Έλž˜λ° ν”„λ‘œμ νŠΈ #6

Problem: μž…λ ₯ 데이터 : [Command.txt 0.00MB](https://blog.kakaocdn.net/dna/bnbU30/btqBgeimBnY/AAAAAAAAAAAAAAAAAAAAAAPakDbTA4jf0WyG_DmDE76emfyLiazho4x1advtOToN/Command.txt?credential=yqXZFxpELC7KVnFOS48ylbz2pIh7yKj8&expires=1788188399&allow_ip=&allow_referer=&signature=2iAm290NW4CFkRgpHKAQHRqBvxw%3D&attach=1&knm=tfile.txt) Execution Result: Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 #include<stdio.h> #include<string.h> #include<stdlib.h> void PrintAssm(char* name_buf, int name_size); struct OPTAB{ char name[8]; int len; } Wordtab[] = { {"LDA", 3}, {"STA", 4}, {"ADD", 5}, {"TIX", 2}, {"CMP", 6} }; int main() { char name_buf[8]; int wordtab_size = sizeof(Wordtab)/12; // Wordtab에 μ •μ˜λœ 단어 갯수, 12 = size of char[8] + int FILE* fp; if((fp = fopen("Command.txt", "r"))==NULL) { printf("file not found...\n"); exit(1); } while(fgets(name_buf, sizeof(name_buf), fp) != NULL) { // fgets() ν•¨μˆ˜λŠ” scanfλ‚˜ gets()μ™€λŠ” 달리 뒀에 κ°œν–‰λ¬Έμžκ°€ λΆ™λŠ”λ‹€ if(name_buf[0] == '\n') // name_buf λ°°μ—΄ 맨 처음이 κ°œν–‰λ¬Έμžμ΄λ©΄ λ©”μ‹œμ§€ 좜λ ₯ 없이 λ¬΄μ‹œ continue; if(name_buf[strlen(name_buf) - 1] == '\n') // name_buf λ°°μ—΄ 맨 끝이 κ°œν–‰λ¬Έμžμ΄λ©΄ name_buf[strlen(name_buf) - 1] = '\0'; // naem_buf λ°°μ—΄ 맨 끝에 뢙은 κ°œν–‰λ¬Έμž 제거 PrintAssm(name_buf, wordtab_size); } fclose(fp); } void PrintAssm(char* name_buf, int wordtab_size){ static int k=1; // 쀄 번호λ₯Ό λ‚˜νƒ€λ‚΄λŠ” λ³€μˆ˜ static int loc=0; // λ‹¨μ–΄μ˜ μ‹œμž‘ μœ„μΉ˜λ₯Ό λ‚˜νƒ€λ‚΄λŠ” λ³€μˆ˜ int i, res=-1; for(i=0; i<wordtab_size; i++){ res = strcmp(name_buf, Wordtab[i].name); // strcmp : 두 λ¬Έμžμ—΄μ΄ κ°™μœΌλ©΄ 0 리턴 if(res==0){ break; } } if(i==wordtab_size){ printf(" Undefined word\n"); // Wordtab λ°°μ—΄ μ•ˆμ— μ •μ˜λ˜μ–΄ μžˆμ§€ μ•ŠλŠ” λͺ…λ Ήμ–΄λ©΄ 좜λ ₯ν•˜κ³  단어 λ¬΄μ‹œ } else{ if(k < 10) printf(" "); printf("%d, %.2X, %s, %.2d\n", k, loc, Wordtab[i].name, Wordtab[i].len); loc += Wordtab[i].len; // λ‹¨μ–΄μ˜ 해당길이λ₯Ό λ”ν•΄μ„œ λ‹€μŒ μ‹œμž‘ μœ„μΉ˜λ₯Ό μ•Œλ €μ€Œ k++; } } Explanation: ...

November 21, 2019 Β· 2 min Β· Sobamemil
πŸ’» Dev & CSC++ Programming

C++ Programming Ch.9 Exercise 8 Solution

Problem: μ‚¬κ°ν˜•μ— λ‚΄μ ‘ν•˜λŠ” λ„ν˜•μ„ ν‘œν˜„ν•˜κΈ° μœ„ν•œ Shape ν΄λž˜μŠ€κ°€ μžˆλ‹€. 1 2 3 4 5 6 7 8 9 class Shape { protected: string name; // λ„ν˜•μ˜ 이름 int width, height; // λ„ν˜•μ΄ λ‚΄μ ‘ν•˜λŠ” μ‚¬κ°ν˜•μ˜ λ„ˆλΉ„μ™€ 높이 public: Shape(string n="", int w=0, int h=0) { name = n; width = w; height = h; } virtual double getArea() { return 0; } // dummy κ°’ 리턴 string getName() { return name; } // 이름 리턴 }; 문제 7에 μ£Όμ–΄μ§„ Shape 클래슀λ₯Ό 좔상 클래슀둜 λ§Œλ“€κ³  문제 7을 λ‹€μ‹œ μž‘μ„±ν•˜λΌ. ...

November 21, 2019 Β· 2 min Β· Sobamemil
πŸ’» Dev & CSC++ Programming

C++ Programming Ch.9 Exercise 7 Solution

Problem: μ‚¬κ°ν˜•μ— λ‚΄μ ‘ν•˜λŠ” λ„ν˜•μ„ ν‘œν•œν•˜κΈ° μœ„ν•œ Shape ν΄λž˜μŠ€κ°€ μžˆλ‹€. 1 2 3 4 5 6 7 8 9 class Shape { protected: string name; // λ„ν˜•μ˜ 이름 int width, height; // λ„ν˜•μ΄ λ‚΄μ ‘ν•˜λŠ” μ‚¬κ°ν˜•μ˜ λ„ˆλΉ„μ™€ 높이 public: Shape(string n="", int w=0, int h=0) { name = n; width = w; height = h; } virtual double getArea() { return 0; } // dummy κ°’ 리턴 string getName() { return name; } // 이름 리턴 }; Write a 타원을 ν‘œν˜„ν•˜λŠ” Oval, μ‚¬κ°ν˜•μ„ ν‘œν˜„ν•˜λŠ” Rect, μ‚Όκ°ν˜•μ„ ν‘œν˜„ν•˜λŠ” Triangular class that inherits from the Shape class. main()을 μž‘μ„±ν•˜κ³  μ‹€ν–‰ν•˜λ©΄ λ‹€μŒκ³Ό κ°™λ‹€. ...

November 21, 2019 Β· 2 min Β· Sobamemil
πŸ’» Dev & CSC++ Programming

C++ Programming Ch.9 Exercise 6 Solution

Problem: λ‹€μŒ AbstractStack은 μ •μˆ˜ μŠ€νƒ ν΄λž˜μŠ€λ‘œμ„œ 좔상 ν΄λž˜μŠ€μ΄λ‹€. 1 2 3 4 5 6 7 class AbstrackStack { public: virtual bool push(int n) = 0; // μŠ€νƒμ— n을 ν‘Έμ‹œν•œλ‹€. μŠ€νƒμ΄ full이면 false 리턴 virtual bool pop(int& n) = 0; // μŠ€νƒμ—μ„œ νŒν•œ μ •μˆ˜λ₯Ό n에 μ €μž₯ν•˜κ³  μŠ€νƒμ΄ empty이면 false 리턴 virtual int size() = 0; }; 이λ₯Ό 상속받아 μ •μˆ˜λ₯Ό ν‘Έμ‹œ, νŒν•˜λŠ” IntStack 클래슀λ₯Ό λ§Œλ“€κ³  μ‚¬μš© 사둀λ₯Ό 보여라. Objective & Hints: ...

November 21, 2019 Β· 2 min Β· Sobamemil