๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

โœ’๏ธ C Programming/๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ_๊ฐœ์ • 3ํŒ31

[๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ - ๊ฐœ์ • 3ํŒ] 14์žฅ Programming ํ’€์ด # 14์žฅ Programming ํ’€์ด 547p_1๋ฒˆ) #include #define DEBUG // Line 2๋ฅผ ์ฃผ์„์ฒ˜๋ฆฌํ•˜๋ฉด ๋งคํฌ๋กœ ์ •์˜๊ฐ€ ํ•ด์ œ๋จ void cal(int *ptr) { int sum = 0; #ifdef DEBUG printf("๋ฐฐ์—ด array๋กœ๋ถ€ํ„ฐ ๋ฐ›์•„์˜จ ๋งค๊ฐœ๋ณ€์ˆ˜: \n"); for (int i = 0; i < 8; i++) { if (i == 7) { printf("%d ", ptr[i]); } else { printf("%d, ", ptr[i]); } } printf("\n\n"); #endif for (int i = 0; i < 8; i++) { sum += ptr[i]; #ifdef DEBUG printf("%d๋ฅผ ๋”ํ•˜๋Š” ์ค‘\n", ptr[i]); #endif } printf(.. 2023. 2. 4.
[๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ - ๊ฐœ์ • 3ํŒ] 14์žฅ Mini Project ๋ฌธ์ œ ํ’€์ด # 14์žฅ Mini Project ๋ฌธ์ œ ํ’€์ด 544p_Mini Project) #include #define language 3 int main() { #if language == 1 //ํ•œ๊ตญ์–ด๋กœ ์ถœ๋ ฅ printf("=================== 2์›” ====================\n"); printf("์ผ ์›” ํ™” ์ˆ˜ ๋ชฉ ๊ธˆ ํ† \n"); for (int i = 1; i < 29; i++) { if (i % 7 == 4) { printf("%d ", i); printf("\n"); } else { if (i < 10) { if (i == 1) { printf(" %d ", i); } else { printf("%d ", i); } } else { printf("%d ", i); } } } #e.. 2023. 2. 3.
[๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ - ๊ฐœ์ • 3ํŒ] 13์žฅ Programming ํ’€์ด # 13์žฅ Programming ํ’€์ด 510p_1๋ฒˆ) #include #include int main() { int num = 0; double sum = 0.0; double *array; printf("์š”์†Œ ๊ฐœ์ˆ˜: "); scanf_s("%d", &num); array = (double*)malloc(num * sizeof(double)); for (int i = 0; i < num; i++) { printf("๋ฐฐ์—ด ์š”์†Œ๋ฅผ ์ž…๋ ฅํ•˜์‹œ์˜ค: "); scanf_s("%lf", &array[i]); sum += array[i]; } printf("ํ•ฉ: %.2lf\n", sum); free(array); return 0; } 510p_2๋ฒˆ) #include #include int main() { int num .. 2023. 2. 1.
[๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ - ๊ฐœ์ • 3ํŒ] 13์žฅ Mini Project ๋ฌธ์ œ ํ’€์ด # 13์žฅ Mini Project ๋ฌธ์ œ ํ’€์ด 508p_Mini Project) #include #include struct NODE { int data; struct NODE* link; }; int main() { struct NODE* head_node = (struct NODE*)malloc(sizeof(struct NODE)); //๋จธ๋ฆฌ ๋…ธ๋“œ ์ƒ์„ฑ head_node->link = NULL; struct NODE* node_1 = (struct NODE*)malloc(sizeof(struct NODE)); //1๋ฒˆ์งธ ๋…ธ๋“œ ์ƒ์„ฑ node_1->link = head_node->link; node_1->data = 1; head_node->link = node_1; struct NODE* node_2 =.. 2023. 1. 31.
[๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ - ๊ฐœ์ • 3ํŒ] 12์žฅ Programming ํ’€์ด (2) # 12์žฅ Programming ํ’€์ด (2) 490p_7๋ฒˆ) #include #include int main() { int change = 0; char one[20]; char two[20]; char get_one[100]; char get_two[100]; FILE* file1; FILE* file2; printf("์ฒซ ๋ฒˆ์งธ ํŒŒ์ผ๋ช…: "); gets_s(one, 20); printf("๋‘ ๋ฒˆ์งธ ํŒŒ์ผ๋ช…: "); gets_s(two, 20); fopen_s(&file1, one, "r"); fopen_s(&file2, two, "r"); while (!feof(file1)) { fgets(get_one, 100, file1); fgets(get_two, 100, file2); if (strcmp(get.. 2023. 1. 30.
[๋ˆ„๊ตฌ๋‚˜ ์‰ฝ๊ฒŒ ์ฆ๊ธฐ๋Š” C ์–ธ์–ด ์ฝ˜์„œํŠธ - ๊ฐœ์ • 3ํŒ] 12์žฅ Programming ํ’€์ด (1) # 12์žฅ Programming ํ’€์ด (1) 488p_1๋ฒˆ) #include #include #include int main() { char name[100]; int c; int i = 0; printf("ํŒŒ์ผ๋ช…์„ ์ž…๋ ฅํ•˜์‹œ์˜ค: "); gets_s(name, 100); FILE* fp; fopen_s(&fp, "good.txt", "r"); if (fp == NULL) { printf("ํŒŒ์ผ ์—ด๊ธฐ ์‹คํŒจ\n"); exit(1); } printf("%d ", i++); while ((c = fgetc(fp)) != EOF) { if (ftell(fp) == 17) { printf("%d ", i); } putchar(c); } fclose(fp); return 0; } 488p_2๋ฒˆ) #include int.. 2023. 1. 29.