This commit is contained in:
암냥 2026-04-08 16:02:20 +09:00
commit d42448a9d0
No known key found for this signature in database
13 changed files with 187 additions and 0 deletions

1
.gitignore vendored
View file

@ -1 +1,2 @@
output output
*.run

View file

@ -11,4 +11,16 @@
"show_summary": true, "show_summary": true,
"show_command": true, "show_command": true,
}, },
{
"label": "Build & Run Current File (Linux - Fish)",
"command": "mkdir -p ./output; set rand (tr -dc 'a-z' < /dev/urandom | head -c 6); set outputFile \"./output/${ZED_STEM}_$rand\"; gcc -Wall -Wextra -g -std=c11 -O2 \"$ZED_FILE\" -o \"$outputFile\"; and \"$outputFile\"",
"use_new_terminal": false,
"allow_concurrent_runs": false,
"reveal": "always",
"reveal_target": "dock",
"hide": "never",
"shell": "system",
"show_summary": true,
"show_command": true,
},
] ]

13
03/a.c Normal file
View file

@ -0,0 +1,13 @@
#include <stdio.h>
int main() {
int a = 10;
int b = 6;
int c = 3;
printf("%d\n", ~a);
printf("%d\n", a & b);
printf("%d\n", a ^ b);
printf("%d\n", a | b);
printf("%d\n", a | b & c);
return 0;
}

14
03/ex01.c Normal file
View file

@ -0,0 +1,14 @@
#include <stdio.h>
int main() {
int a,b;
printf("정수 입력 : ");
scanf("%d %d", &a, &b);
printf("[결과 출력]\n");
printf("%d + %d = %d\n", a, b, a+b);
printf("%d - %d = %d\n", a, b, a-b);
printf("%d * %d = %d\n", a, b, a*b);
printf("%d / %d = %d\n", a, b, a/b);
printf("%d %% %d = %d\n", a, b, a%b);
}

12
03/ex02.c Normal file
View file

@ -0,0 +1,12 @@
#include <stdio.h>
int main() {
int n;
printf("정수 n입력(0≤n<1000) : ");
scanf("%d", &n);
printf("%d의\n", n);
printf("100의 자리수 : %d\n", n / 100);
printf("10의 자리수 : %d\n", (n / 10) % 10);
printf("1의 자리수 : %d\n", n % 10);
return 0;
}

16
03/ex03.c Normal file
View file

@ -0,0 +1,16 @@
#include <stdio.h>
int main() {
int num[5];
int max;
printf("정수 5개 입력 : ");
for (int i = 0; i < 5; i++) {
scanf("%d", &num[i]);
if (num[i] > max) {
max = num[i];
}
}
printf("입력한 정수 중 가장 큰 수는\n%d 입니다.\n", max);
return 0;
}

33
03/playground.c Normal file
View file

@ -0,0 +1,33 @@
#include <stdio.h>
// int main()
// {
// int mizuki, ena, kanade;
// scanf("%d %d %d", &mizuki, &ena, &kanade);
// int max;
// if (mizuki > ena) {
// if (mizuki > kanade) {
// max = mizuki;
// } else {
// max = kanade;
// }
// } else {
// if (ena > kanade) {
// max = ena;
// } else {
// max = kanade;
// }
// }
// printf("%d", max);
// return 0;
// }
int main()
{
int mizuki, ena, kanade;
scanf("%d %d %d", &mizuki, &ena, &kanade);
int mizuena = (mizuki > ena) ? mizuki : ena;
printf("%d", (mizuena > kanade) ? mizuena : kanade);
return 0;
}

16
03/sub01.c Normal file
View file

@ -0,0 +1,16 @@
#include <stdio.h>
int main() {
int people, price;
printf("사람 수(명) 입력: ");
scanf("%d", &people);
printf("총 사용 금액(원) 입력: ");
scanf("%d", &price);
printf("==== 결과 ====\n");
printf("각자 낼 금액: %d원\n", price/people);
printf("메신저 페이가 지불한 금액: %d원\n", price%people);
printf("==============");
return 0;
}

14
03/sub02.c Normal file
View file

@ -0,0 +1,14 @@
#include <stdio.h>
int main() {
int price;
printf("제품의 가격을 입력하세요: ");
scanf("%d", &price);
printf("==== 영수증 ====\n");
printf("제품 가격: %d원\n", price);
printf("부가세: %d원\n", price * 10 / 100);
printf("최종 가격: %d원\n", price * 110 / 100);
printf("==============");
return 0;
}

15
layer7/amazing.c Normal file
View file

@ -0,0 +1,15 @@
#include <stdio.h>
int main() {
unsigned int i = 0;
int count = 0;
int sum = 0;
while (sum < 100) {
scanf("%d", &i);
sum += i;
count++;
}
printf("%d | %d", sum, count);
return 0;
}

14
layer7/cool.c Normal file
View file

@ -0,0 +1,14 @@
#include <stdio.h>
#include <string.h>
int main() {
char a[100], b[100];
scanf("%s", &a);
scanf("%s", &b);
if(strcmp(a,b) == 0) {
printf("같습니다");
}
else {
printf("%s", strcat(a,b));
}
}

14
layer7/main.c Normal file
View file

@ -0,0 +1,14 @@
#include <stdio.h>
int main() {
int age;
scanf("%d", &age);
if (age < 18) {
printf("미성년자");
} else if (age < 65) {
printf("성인");
} else {
printf("노인");
}
return 0;
}

13
layer7/wow.c Normal file
View file

@ -0,0 +1,13 @@
#include <stdio.h>
int main() {
int n, count = 0;
scanf("%d", &n);
for (int i=1; i < n+1; i++) {
if (i%3 == 0) {
count++;
printf("%d ", i);
}
}
printf("\n3의 배수 갯수 : %d\n", count);
return 0;
}